Author:
Kutrib Martin,Malcher Andreas,Wendlandt Matthias
Publisher
Springer International Publishing
Reference10 articles.
1. Cherubini, A., Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: QRT FIFO automata, breadth-first grammars and their relations. Theoret. Comput. Sci. 85, 171–203 (1991)
2. Chomsky, N.: On certain formal properties of grammars. Inform. Control 2, 137–167 (1959)
3. Daley, M., Eramian, M.G., McQuillan, I.: The bag automaton: A model of nondeterministic storage. J. Autom., Lang. Comb. 13, 185–206 (2008)
4. Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14, 389–418 (1967)
5. Lecture Notes in Computer Science;M. Holzer,2003
Cited by
6 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
5. Regularity and Size of Set Automata;Descriptional Complexity of Formal Systems;2014