Selected papers that cite this one
- Alfred V. Aho. Nested stack automata. Journal of the ACM, 16(3):383-406, July 1969.
- Ronald V. Book and Sheila A. Greibach. Quasi-realtime languages -- extended abstract. In Conference Record of ACM Symposium on Theory of Computing, pages 15-18, Marina del Rey, California, 5-7 May 1969.
- Gerhard Buntrock and Friedrich Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141(1):1-36, 25 February 1998.
- James N. Gray and Michael A. Harrison. Canonical precedence schemes. Journal of the ACM, 20(2):214-234, April 1973.
- Sheila Greibach and Seymour Ginsburg. Multitape AFA. Journal of the ACM, 19(2):193-221, April 1972.
Selected references
- Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-167, June 1959.
- 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.
- Sheila A. Greibach. A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM, 12(1):42-52, January 1965.
- S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and Control, 7(2):207-223, June 1964.
- Arnold L. Rosenberg. Real-time definable languages. Journal of the ACM, 14(4):645-662, October 1967.