Author:
Kutrib Martin,Malcher Andreas,Wendlandt Matthias
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Bach, E., Shallit, J.: Algorithmic Number Theory, Foundations of Computing, vol. 1. MIT Press (1996)
2. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986)
3. Ellul, K.: Descriptional Complexity Measures of Regular Languages. Master’s thesis, University of Waterloo, Ontario, Canada (2004)
4. Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inform. Comput. 205, 1652–1670 (2007)
5. Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theoret. Comput. Sci. 295, 189–203 (2003)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Investigations on Automata and Languages Over a Unary Alphabet;International Journal of Foundations of Computer Science;2015-11
2. SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA;International Journal of Foundations of Computer Science;2014-11
3. Investigations on Automata and Languages over a Unary Alphabet;Implementation and Application of Automata;2014
4. Complexity of Operation Problems;Language, Life, Limits;2014