Abstract
Let DPDA(k) (resp. NPDA(k)) be the class of languages recognized by one-way k-head deterministic (resp. nondeterministic) pushdown automata. The main result of this paper is that for each k>0 DPDA(k) ⪇ DPDA (k+1) and DPDA(k) ⪇ NPDA(k).
Preview
Unable to display preview. Download preview PDF.
References
P. Ďuris, J. Hromkovič, One-way simple multihead finite automata are not closed under concatenation, Theoret. Comput. Sci. 27 (1983) 121–125.
R.W. Floyd, Review 14,353 of 18, Comput. Rev. 9 (1968) 280.
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
S. Ginsburg, E.H. Spanier, Bounded Algol-like languages, Trans. Amer. Math. Soc. 113 (1963) 333–368.
S. Ginsburg, E.H. Spanier, Bounded regular sets, Proc. Amer. Math. Soc. 17 (1966) 1043–1049.
S.A. Greibach, An infinite hierarchy of context-free languages, J.Assoc. Comput. Mach. 16 (1969) 91–106.
M.A. Harrison, O.H. Ibarra, Multi-tape and multi-head pushdown automata, Inform. Control 13 (1968) 433–470.
J. Hromkovič, Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata, Proc. 10th MFCS, Lecture Notes in Comput. Sci. 118, 1981, 304–313.
J. Hromkovič, One-way multihead deterministic finite automata, Acta Inform. 19 (1983) 377–384.
O.H. Ibarra, A note on semilinear sets and bounded reversal multi-head pushdown automata, Inform. Proc. Letters 3 (1974) 25–28.
O.H. Ibarra, C.E. Kim, A useful device for showing the solvability of some decision problems, J. Comput. System Sci. 13 (1976) 153–160.
O.H. Ibarra, C.E. Kim, On 3-head versus 2-head finite automata, Acta Inform. 4 (1975) 193–200.
K. Inoue, I. Takanami, A. Nakamura, T. Ae, One-way simple multihead finite automata, Theoret. Comput. Sci. 9 (1979) 311–328.
S. Miyano, A hierarchy theorem for multihead stack-counter automata, Acta Inform. 17 (1982) 63–67.
S. Miyano, Remarks on multihead pushdown automata and multihead stack automata, J. Comput. System Sci. 27 (1983) 116–124.
T.F.Piatkowski, N-head finite-state machines, Ph.D. Dissertation, University of Michigan, 1963.
A.L.Rosenberg, Nonwriting extensions of finite automata, Ph.D. Dissertation, Harvard University, 1965.
A.L. Rosenberg, On multihead finite automata, IBM J. Res. Develop. 10 (1966) 388–394.
I.H. Sudborough, One-way multihead writing automata, Inform. Control 25 (1976) 1–20.
A.C. Yao, R.L. Rivest, k+1 heads are better than k, J. Assoc. Comput. Mach. 25 (1978) 337–340.
M.Chrobak, Variations on the technique of Duris and Galil, to appear in J. Comput. System Sci. 30 (1985).
O.H. Ibarra, Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata, J. Comput. System. Sci. 5 (1971) 88–117.
O.H. Ibarra, On two-way multihead automata, J. Comput. System Sci. 7 (1973) 28–37.
B. Monien, Transformational methods and their application to complexity problems, Acta Inform. 6 (1976) 67–80, Corrigenda: Acta Inform. 8 (1977) 95.
B. Monien, Two-way multihead automata over a one-letter alphabet, RAIRO Inform. Theoret. 14 (1980) 67–82.
J.I. Seiferas, Techniques for separating space complexity classes, J. Comput. System Sci. 14 (1977) 73–99.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chrobak, M. (1985). Hierarchies of one-way multihead automata languages. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015735
Download citation
DOI: https://doi.org/10.1007/BFb0015735
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive