Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference13 articles.
1. Transition graphs and the star height of regular events;Eggan;Michigan Math. J.,1963
2. Techniques for manipulating regular expressions;McNaughton,1965
3. The loop complexity of regular events;McNaughton;Inform. Sci.,1969
4. The loop complexity of pure-group events;McNaughton;Information and Control,1967
5. Cycle rank of transition graphs and the star height of regular events;Cohen,1968
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The chop of languages;Theoretical Computer Science;2017-06
2. Characterization and complexity results on jumping finite automata;Theoretical Computer Science;2017-05
3. Stamina: Stabilisation Monoids in Automata Theory;Implementation and Application of Automata;2017
4. Star Height via Games;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07
5. Some Variants of the Star Height Problem;Mathematical Foundations of Computer Science 2011;2011