On the computational power of reversal-bounded machines

  • Ronald V. Book
  • Chee K. Yap
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


Polynomial Time Linear Time Turing Machine Input Tape Deterministic Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    B. Baker and R. Book, Reversal-bounded multipushdown machines, JCSS 8 (1974), 315–322.Google Scholar
  2. 2.
    R. Book, Simple representations of certain classes of languages, submitted for publication.Google Scholar
  3. 3.
    R. Book and S. Greibach, Quasi-realtime languages, Math. Systems Theory 4 (1970), 97–111.Google Scholar
  4. 4.
    R. Book and M. Nivat, Linear languages and intersections of classes of languages, in preparation.Google Scholar
  5. 5.
    R. Book, M. Nivat, and M. Paterson, Reversal-bounded acceptors and intersections of linear languages, SIAM J. Computing 3 (1974), 283–295.Google Scholar
  6. 6.
    P. Fischer, The reduction of tape reversals for off-line one-tape Turing machines, JCSS 2 (1968), 136–147.Google Scholar
  7. 7.
    P. Fischer, A. Meyer, and A. Rosenberg, Real-time simulation of multihead tape units, JACM 19 (1972), 590–607.Google Scholar
  8. 8.
    S. Ginsburg and E. Spanier, Finite-turn pushdown machines, SIAM J. Control 4 (1966), 429–453.Google Scholar
  9. 9.
    S. Greibach, An infinite hierarchy of context-free languages, JACM 16 (1969), 91–106.Google Scholar
  10. 10.
    S. Greibach, Remarks on the complexity of nondeterministic counter languages, Theoretical Computer Science 1 (1976), 269–288.Google Scholar
  11. 11.
    S. Greibach, Visits, crosses and reversals for nondeterministic off-line machines, Info. Control, to appear.Google Scholar
  12. 12.
    J. Hartmanis, Tape-reversal bounded Turing machine computations, JCSS 2 (1968), 117–135.Google Scholar
  13. 13.
    J. Hartmanis and R. Stearns, On the computational complexity of algorithms, Trans. Amer. Math. Soc. 117 (1965), 285–306.Google Scholar
  14. 14.
    T. Kameda and R. Vollmar, Note on tape reversal complexity of languages, Info. Control 17 (1970), 203–215.Google Scholar
  15. 15.
    A. Rosenberg, Real-time definable languages, JACM 14 (1967), 645–662.Google Scholar
  16. 16.
    R. Schroeppel, A two counter machine cannot calculate 2n, M.I.T. AI Memo. 257 (1973).Google Scholar
  17. 17.
    F. Yao, Computation by 2-counter machines, unpublished paper.Google Scholar
  18. 18.
    A. Barashka, Concerning the number of reversals of the stack head of a two-way pushdown automaton, Cybernetics 4 (1975), 564–570.Google Scholar
  19. 19.
    R. Book, On languages with a certain prefix property, Math. Systems Theory 10 (1977), to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ronald V. Book
    • 1
  • Chee K. Yap
    • 2
  1. 1.Department of Mathematics and Computer Science ProgramUniversity of CaliforniaSanta BarbaraUSA
  2. 2.Department of Computer ScienceYale UniversityNew HavenUSA

Personalised recommendations