Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Dejean, F., Schützenberger, M.: On a question of Eggan. Information and Control 9, 23–25 (1966)
2. Eggan, L.C.: Transition graphs and the star height of regular events. Michigan Math. Journal 10, 385–397 (1963)
3. Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. Journal of Computer and System Sciences 24, 233–244 (1982)
4. Hashiguchi, K.: Regular languages of star height one. Information and Control 53, 199–210 (1982)
5. Kirsten, D.: Desert automata I. A Burnside problem and its solution. LIAFA Tech. Rep. In: Diekert, V., Habib, M. (eds.) STACS 2004 Proceedings (extended abstract appeared), Paris. LNCS, Springer, Berlin (2003)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Limited Non-determinism Hierarchy of Counter Automata;Language and Automata Theory and Applications;2013
2. Some Variants of the Star Height Problem;Mathematical Foundations of Computer Science 2011;2011
3. Distance desert automata and the star height problem;RAIRO - Theoretical Informatics and Applications;2005-07
4. Desert Automata and the Finite Substitution Problem;Lecture Notes in Computer Science;2004