On complexity of nondeterministic Turing machines computations
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.
- 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.Chytil M. P., Crossing-bounded computations and their relation to the LBA-problem. Submitted for publication.Google Scholar