Author:
Hromkovič Juraj,Královič Rastislav,Královič Richard,Štefanec Richard
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Berman, P., Lingas, A.: On complexity of regular languages in terms of finite automata. Technical report, Institute of Computer Science, Polish Academy of Sciences, Warsaw (1977)
2. Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science 47(2), 149–158 (1986)
3. Lecture Notes in Computer Science;P. Duriš,2001
4. Geffert, V.: Magic numbers in the state hierarchy of finite automata. Information and Computation 205(11), 1652–1670 (2007)
5. Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theoretical Computer Science 295, 189–203 (2003)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Size of Logical Automata;SOFSEM 2019: Theory and Practice of Computer Science;2019