On complexity of nondeterministic Turing machines computations

  • Michael P. Chytil
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


A relation of three complexity measures for nondeterministic one-tape, one-head Turing machines is established in this paper. Namely, the fact that for every arithmetic function f such that (∀ n) (f(n) ≥ n) the class of languages recognized with the tape bound f coincides with the classes of languages recognized with the crossing and reversal bound f, respectively, is proved. This result is used to show that CS-languages can be characterized as a "projection" of a class of languages recognized by deterministic Turing machines.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hennie F. C., One-tape, off-line Turing machine computations, Information and Control, 8, (1965), 553–578.CrossRefGoogle Scholar
  2. 2.
    Kuroda S. Y., Classes of languages and linear bounded automata, Information and Control, 7 (1964), 207–223.CrossRefGoogle Scholar
  3. 3.
    Chytil M. P., Crossing-bounded automata and their relation to the LBA problem. In "Tagung über Automatentheorie und Formale Sprachen, 1974", Universität Dortmund, Abteilung Informatik.Google Scholar
  4. 4.
    Chytil M. P., Crossing-bounded computations and their relation to the LBA-problem. Submitted for publication.Google Scholar
  5. 5.
    Kameda T., Vollmar R., Note on tape reversal complexity of languages, Information and Control, 13 (1970), 203–215.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Michael P. Chytil
    • 1
  1. 1.Faculty of Mathematics and Physics Dept. of Computer ScienceCharles UniversityPrague 1 — M. Strana

Personalised recommendations