Author:
Hospodár Michal,Holzer Markus
Publisher
Springer International Publishing
Reference17 articles.
1. Cho, D.-J., Goč, D., Han, Y.-S., Ko, S.-K., Palioudakis, A., Salomaa, K.: State complexity of permutation on finite languages over a binary alphabet. Theoret. Comput. Sci. 682, 67–78 (2017)
2. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986)
3. Dassow, J.: On the number of accepting states of finite automata. J. Autom. Lang. Comb. 21(1–2), 55–67 (2016)
4. Lecture Notes in Computer Science;J Dassow,2017
5. Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inf. Comput. 205(11), 1652–1670 (2007)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献