Journal of the ACM Bibliography
Oscar H. Ibarra. A note
concerning nondeterministic tape complexities. Journal of the
ACM, 19(4):608-612, October 1972.
[BibTeX entry]
Additional Key Words and Phrases:
nondeterministic Turing machine, deterministic Turing machine, tape
function, tape bounded, complexity, fully constructable, two-way
nondeterministic nonerasing stack automata, two-way nondeterministic
checking stack automata, context-sensitive language
Selected papers that cite this one
Selected references
- Ronald V. Book and Ben Wegbreit. A note on AFLs and bounding
erasing. Information and Control, 19(1):18-29, August
1971.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. Stack automata and
compiling. Journal of the ACM, 14(1):172-201, January
1967.
- J. E. Hopcroft and J. D. Ullman. Some results on tape-bounded
Turing machines. Journal of the ACM, 16(1):168-177,
January 1969.
- S. S. Ruby and P. C. Fischer. Translational methods and
computational complexity. In Proceedings of the Sixth Annual
Symposium on Switching Circuit Theory and Logical Design, pages
173-178. 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: