Abstract
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all heads on the left end marker, reaches the configuration where all the heads are on the right end marker. The nondeterministic version is denoted by k-head 2NFA.
We prove that stateless (k + 1)-head 2DFAs (resp., 2NFAs) are computationally more powerful than k-head 2DFAs (resp., 2NFAs), improving a recent result where it was shown that (k + 4) heads are better than k heads.
We also study stateless multihead pushdown automata in their two-way and one-way, deterministic and nondeterministic variations and show that for all these varieties, k + 1 heads allow more computational power than k heads. Finally, we give some characterizations of stateless multihead finite and multihead pushdown automata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chrobak, M., Li, M.: k+1 heads are better than k for PDA’s. In: Proceedings of the 27th Annual Symp. on Foundations of Computer Science, pp. 361–367 (1986)
Cook, S.: Variations on pushdown machines. In: Proceedings of the Annual ACM Symp. on Theory of Computing, pp. 229–231 (1969)
Ibarra, O.H.: On two-way multihead automata. J. of Computer and System Sciences 7, 28–36 (1973)
Ibarra, O.H., Karhumaki, J., Okhotin, A.: On stateless multihead automata: hierarchies and the emptiness problem. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 94–105. Springer, Heidelberg (2008)
Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO Informatique theoretique 14(1), 67–82 (1980)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 108, 143 (2000)
Păun, G.: Membrane Computing, An Introduction. Springer, Heidelberg (2002)
Sudborough, I.H.: On tape-bounded complexity classes and multi-head finite automata. In: Proc. of 14th Annual Symp. on Foundations of Computer Science, pp. 138–144 (1973)
Rosenberg, A.L.: On multi-head finite automata. IBM Journal of Research and Development 10(5), 388–394 (1966)
Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. In: Pre-Proceedings of Workshop on Automata for Cellular and Molecular Computing (August 2007)
Yao, A.C., Rivest, R.L.: k + 1 heads are better than k. Journal of the ACM 25(2), 337–340 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frisco, P., Ibarra, O.H. (2009). On Stateless Multihead Finite Automata and Multihead Pushdown Automata. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)