Chapter PDF
References
Book, R.V.: On the structure of complexity classes, 2 nd Colloquium: Automata, Languages and Programming, 1974, 437–445.
Hartmanis, J., On Non-Determinacy in Simple Computing Devices, Acta Informatica 1 (1972), 336–344.
Knuth, D.E., Postscript about NP-hard problems, SIGACT News 6, 2 (1974), 15–16.
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.
Monien, B., Transformational Methods and their Application to Complexity Problems, submitted for publication
Savitch, W.J., Relationships between nondeterministic and deterministic tape complexity, J. Comp. Syst. Sci. 4 (1970), 177–192.
Savitch, W.J. Maze Recognizing Automata and Nondeterministic Tape Complexity, J. Comp. Syst. Sci. 7 (1973), 389–403.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monien, B. (1975). About the deterministic simulation of nondeterministic (log n)-tape bounded turing machines. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive