Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Hennie F. C., One-tape, off-line Turing machine computations, Information and Control, 8, (1965), 553–578.
Kuroda S. Y., Classes of languages and linear bounded automata, Information and Control, 7 (1964), 207–223.
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.
Chytil M. P., Crossing-bounded computations and their relation to the LBA-problem. Submitted for publication.
Kameda T., Vollmar R., Note on tape reversal complexity of languages, Information and Control, 13 (1970), 203–215.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chytil, M.P. (1975). On complexity of nondeterministic Turing machines computations. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_196
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_196
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive