About the deterministic simulation of nondeterministic (log n)-tape bounded turing machines

  • Burkhard Monien
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)


  1. 1.
    Book, R.V.: On the structure of complexity classes, 2 nd Colloquium: Automata, Languages and Programming, 1974, 437–445.Google Scholar
  2. 2.
    Hartmanis, J., On Non-Determinacy in Simple Computing Devices, Acta Informatica 1 (1972), 336–344.Google Scholar
  3. 3.
    Knuth, D.E., Postscript about NP-hard problems, SIGACT News 6, 2 (1974), 15–16.Google Scholar
  4. 4.
    Lewis, P.M. Stearns, R.E. and Hartmanis, J., Memory bounds for recognition of context-free and context-sensitive languages, IEEE conf.rec. 7-th ann. symp. Switch.Cir.Th.Log.Des., 1965, 191–202.Google Scholar
  5. 5.
    Monien, B., Transformational Methods and their Application to Complexity Problems, submitted for publicationGoogle Scholar
  6. 6.
    Savitch, W.J., Relationships between nondeterministic and deterministic tape complexity, J. Comp. Syst. Sci. 4 (1970), 177–192.Google Scholar
  7. 7.
    Savitch, W.J. Maze Recognizing Automata and Nondeterministic Tape Complexity, J. Comp. Syst. Sci. 7 (1973), 389–403.Google Scholar
  8. 8.
    Sudborough, I.H., On Tape-Bounded Complexity Classes and Multi-Head Finite Automata, IEEE conf. rec. 14-th ann.symp.Switch.Aut.Th., 1973, 138–144.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Burkhard Monien
    • 1
  1. 1.Abteilung InformatikUniversität DortmundGermany

Personalised recommendations