Advertisement

Nondeterminism is essential for two-way counter machines

  • Marek Chrobak
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 176)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T-h Chan, Reversal complexity of counter machines, Proc. 13th Annual STOC, Milwaukee, 1981, 146–157.Google Scholar
  2. 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. 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. 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. 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. 6.
    J.E. Hopcroft, J.D. Ullman, Formal languages and their relation to automata, Addison-Wesley, Reading, MA, 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Marek Chrobak
    • 1
  1. 1.Institute of MathematicsPolish Academy of SciencesWarsawPoland

Personalised recommendations