Selected papers that cite this one
- Alfred V. Aho. Nested stack automata. Journal of the ACM, 16(3):383-406, July 1969.
- Stephen A. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the ACM, 18(1):4-18, January 1971.
- Stephen A. Cook. Variations on pushdown machines (detailed abstract). In Conference Record of ACM Symposium on Theory of Computing, pages 229-231, Marina del Rey, California, 5-7 May 1969.
- H. Paul Zeiger. Formal models for some features of programming languages. In Conference Record of ACM Symposium on Theory of Computing, pages 211-215, Marina del Rey, California, 5-7 May 1969.
Selected references
- M. W. Curtis. A Turing machine simulator. Journal of the ACM, 12(1):1-13, January 1965.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. Stack automata and compiling. Journal of the ACM, 14(1):172-201, January 1967.
- Solomon W. Golomb and Leonard D. Baumert. Backtrack programming. Journal of the ACM, 12(4):516-524, October 1965.
- S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and Control, 7(2):207-223, June 1964.