Author:
Lavado Giovanna J.,Pighizzini Giovanni,Seki Shinnosuke
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science 47, 149–158 (1986); Corrigendum, ibid. 302, 497–498 (2003)
2. Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikh’s theorem: A simple and direct automaton construction. Information Processing Letters 111(12), 614–619 (2011)
3. Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. ACM 9, 350–371 (1962)
4. Gruska, J.: Descriptional complexity of context-free languages. In: Proceedings of 2nd Mathematical Foundations of Computer Science, pp. 71–83 (1973)
5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献