Additional Key Words and Phrases: stack automaton, halting problem, recursiveness, complementation, transition matrix, closure properties, nondeterministic stack automaton
Selected papers that cite this one
- Seymour Ginsburg and John Hopcroft. Two-way balloon automata and AFL. Journal of the ACM, 17(1):3-13, January 1970.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. Stack automata and compiling. Journal of the ACM, 14(1):172-201, January 1967.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata. Journal of the ACM, 14(2):389-418, April 1967.
- James N. Gray, Michael A. Harrison, and Oscar H. Ibarra. Two-way pushdown automata. Information and Control, 11(1/2):30-70, July-August 1967.
- J. E. Hopcroft and J. D. Ullman. Sets accepted by one-way stack automata are context sensitive. Information and Control, 13(2):114-133, August 1968.
- J. E. Hopcroft and J. D. Ullman. Some results on tape-bounded Turing machines. Journal of the ACM, 16(1):168-177, January 1969.