Abstract
We show that emptiness is undecidable for alternating one-way two-head finite automata operating on unary input. This solves an open problem posed by Geidmanis. Further we show that a conjecture by King concerning the hierarchy of languages accepted by alternating one-way multihead finite automata does not hold. We also consider closure properties of the languages accepted by these devices and obtain as consequences that the Boolean closures of linear and general context-free languages are contained in the lower levels of the hierarchy. Some other simulation techniques are outlined.
This work was done at the University of Hamburg
Supported in part by ESPRIT Basic Research Action WG 6317: Algebraic and Syntactic Methods in Computer Science (ASMICS 2)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.Ya.Alberts: Possibilities of various types of alternating automata, Cybernetics 6 (1986) (translated from Russian) 714–720.
D.Geidmanis: On possibilities of one-way synchronized and alternating automata, Proc. MFCS 1990 (B.Rovan ed.) LNCS 452, 292–299.
D.Geidmanis: Unsolvability of the emptiness problem for alternating 1-way multi-head and multi-tape finite automata over single-letter alphabet, Computers and Art. Int. 10 (1991) 133–141.
M.A.Harrison, O.H.Ibarra: Multitape and multihead pushdown automata, Inf. Contr. 13 (1968) 433–470.
K.N.King: Alternating multihead finite automata, Theor. Comput. Sci. 61 (1988) 149–174.
M.L.Minsky: Recursive unsolvability of Post's problem of “tag” and other topics in theory of Turing machines, Annals of Mathematics, 74, 3 (1961), 437–455.
A.L.Rosenberg: On multi-head finite automata, IBM Journal Res. and Dev. 10 (1966) 388–394.
K.Wagner, G.Wechsung: Computational Complexity, Reidel, Dordrecht (1986).
A.C.Yao, R.L.Rivest: k+1 heads are better than k, JACM 25 (1978) 337–340.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petersen, H. (1995). Alternation in simple devices. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_84
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive