Author:
Kutrib Martin,Malcher Andreas,Wendlandt Matthias
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Chrobak, M.: Hierarchies of one-way multihead automata languages. Theoret. Comput. Sci. 48, 153–181 (1986)
2. Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)
3. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoret. Comput. Sci. 412, 83–96 (2011)
4. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
5. Ibarra, O.H.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Inform. Process. Lett. 3, 25–28 (1974)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES;International Journal of Foundations of Computer Science;2014-12
2. SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA;International Journal of Foundations of Computer Science;2014-11
3. Complexity of Operation Problems;Language, Life, Limits;2014
4. Size of Unary One-Way Multi-head Finite Automata;Descriptional Complexity of Formal Systems;2013
5. One-Way Reversible Multi-head Finite Automata;Reversible Computation;2013