Skip to main content
SpringerLink
Log in

Nondeterminism is essential for two-way counter machines

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

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. T-h Chan, Reversal complexity of counter machines, Proc. 13th Annual STOC, Milwaukee, 1981, 146–157.

    Google Scholar 

  2. P. Duris, Z. Galil, Fooling a two-way automaton or one pushdown is better than one counter for two-way machines, Theoret. Comput. Sci. 21 (1982), 39–53.

    Google Scholar 

  3. P. Duris, Z. Galil, On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store, Automata, Languages and Programming, 9-th Colloq., Aarus, 1982, Lect. Notes Comput. Sci. 140(1982), 166–175.

    Google Scholar 

  4. Z. Galil, Some open problems in the theory of computation as questions about two-way deterministic pushdown automata languages, Math. Systems Theory 10(1977), 211–228.

    Google Scholar 

  5. E.M. Gurari, O.H. Ibarra, Two-way counter machines and Diophantine equations, J. Assoc. Comput. Mach. 29(1982), 863–873.

    Google Scholar 

  6. J.E. Hopcroft, J.D. Ullman, Formal languages and their relation to automata, Addison-Wesley, Reading, MA, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Polish Academy of Sciences, Sniadeckich 8, 00-950, Warsaw, Poland

    Marek Chrobak

Authors
  1. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chrobak, M. (1984). Nondeterminism is essential for two-way counter machines. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030304

Download citation

  • DOI: https://doi.org/10.1007/BFb0030304

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation