Skip to main content
Springer Nature Link
Log in

Hierarchies of one-way multihead automata languages

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 194))

Included in the following conference series:

  • 136 Accesses

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Ďuris, J. Hromkovič, One-way simple multihead finite automata are not closed under concatenation, Theoret. Comput. Sci. 27 (1983) 121–125.

    Article  Google Scholar 

  2. R.W. Floyd, Review 14,353 of 18, Comput. Rev. 9 (1968) 280.

    Google Scholar 

  3. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.

    Google Scholar 

  4. S. Ginsburg, E.H. Spanier, Bounded Algol-like languages, Trans. Amer. Math. Soc. 113 (1963) 333–368.

    Google Scholar 

  5. S. Ginsburg, E.H. Spanier, Bounded regular sets, Proc. Amer. Math. Soc. 17 (1966) 1043–1049.

    Google Scholar 

  6. S.A. Greibach, An infinite hierarchy of context-free languages, J.Assoc. Comput. Mach. 16 (1969) 91–106.

    Google Scholar 

  7. M.A. Harrison, O.H. Ibarra, Multi-tape and multi-head pushdown automata, Inform. Control 13 (1968) 433–470.

    Article  Google Scholar 

  8. 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.

    Google Scholar 

  9. J. Hromkovič, One-way multihead deterministic finite automata, Acta Inform. 19 (1983) 377–384.

    Article  Google Scholar 

  10. O.H. Ibarra, A note on semilinear sets and bounded reversal multi-head pushdown automata, Inform. Proc. Letters 3 (1974) 25–28.

    Article  Google Scholar 

  11. 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.

    Google Scholar 

  12. O.H. Ibarra, C.E. Kim, On 3-head versus 2-head finite automata, Acta Inform. 4 (1975) 193–200.

    Article  Google Scholar 

  13. K. Inoue, I. Takanami, A. Nakamura, T. Ae, One-way simple multihead finite automata, Theoret. Comput. Sci. 9 (1979) 311–328.

    Article  Google Scholar 

  14. S. Miyano, A hierarchy theorem for multihead stack-counter automata, Acta Inform. 17 (1982) 63–67.

    Article  Google Scholar 

  15. S. Miyano, Remarks on multihead pushdown automata and multihead stack automata, J. Comput. System Sci. 27 (1983) 116–124.

    Article  Google Scholar 

  16. T.F.Piatkowski, N-head finite-state machines, Ph.D. Dissertation, University of Michigan, 1963.

    Google Scholar 

  17. A.L.Rosenberg, Nonwriting extensions of finite automata, Ph.D. Dissertation, Harvard University, 1965.

    Google Scholar 

  18. A.L. Rosenberg, On multihead finite automata, IBM J. Res. Develop. 10 (1966) 388–394.

    Google Scholar 

  19. I.H. Sudborough, One-way multihead writing automata, Inform. Control 25 (1976) 1–20.

    Article  Google Scholar 

  20. A.C. Yao, R.L. Rivest, k+1 heads are better than k, J. Assoc. Comput. Mach. 25 (1978) 337–340.

    Google Scholar 

  21. M.Chrobak, Variations on the technique of Duris and Galil, to appear in J. Comput. System Sci. 30 (1985).

    Google Scholar 

  22. 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.

    Google Scholar 

  23. O.H. Ibarra, On two-way multihead automata, J. Comput. System Sci. 7 (1973) 28–37.

    Google Scholar 

  24. B. Monien, Transformational methods and their application to complexity problems, Acta Inform. 6 (1976) 67–80, Corrigenda: Acta Inform. 8 (1977) 95.

    Article  Google Scholar 

  25. B. Monien, Two-way multihead automata over a one-letter alphabet, RAIRO Inform. Theoret. 14 (1980) 67–82.

    Google Scholar 

  26. J.I. Seiferas, Techniques for separating space complexity classes, J. Comput. System Sci. 14 (1977) 73–99.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, PKIN VIII p., 00-901, Warsaw, Poland

    Marek Chrobak

Authors
  1. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation