Journal of the ACM Bibliography
J. Hartmanis. On the complexity
of undecidable problems in automata theory. Journal of the
ACM, 16(1):160-167, January 1969.
[BibTeX entry]
Additional Key Words and Phrases:
automata, complexity, tape-bounded, Turing machine, undecidable problems
Selected references
- Manuel Blum. A
machine-independent theory of the complexity of recursive functions.
Journal of the ACM, 14(2):322-336, April 1967.
- P. M. Lewis II, R. E. Stearns, and J. Hartmanis. Memory bounds for
recognition of context-free and context-sensitive languages. In
Proceedings of the Sixth Annual Symposium on Switching Circuit
Theory and Logical Design, pages 191-202. IEEE, 1965.
- R. E. Stearns, J. Hartmanis, and P. M. Lewis II. Hierarchies of memory
limited computations. In Proceedings of the Sixth Annual
Symposium on Switching Circuit Theory and Logical Design, pages
179-190. IEEE, 1965.
Shortcuts: