Author:
Kutrib Martin,Malcher Andreas,Wendlandt Matthias
Publisher
Springer International Publishing
Reference7 articles.
1. Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208, 385–394 (2010)
2. Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. UCS 8, 193–234 (2002)
3. Hartmanis, J.: On the succinctness of different representations of languages. SIAM J. Comput. 9, 114–120 (1980)
4. Holzer, M., Kutrib, M.: Descriptional complexity – An introductory survey. In: Martín-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 1–58. Imperial College Press (2010)
5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On computational complexity of set automata;Information and Computation;2021-12
2. On Emptiness and Membership Problems for Set Automata;Computer Science – Theory and Applications;2018
3. On Computational Complexity of Set Automata;Developments in Language Theory;2017
4. Set Automata;International Journal of Foundations of Computer Science;2016-02