Selected papers that cite this one
- Alfred V. Aho. Indexed grammars -- an extension of context-free grammars. Journal of the ACM, 15(4):647-671, October 1968.
- Norbert Blum and Robert Koch. Greibach normal form transformation, revisited. Accepted for publication in Information and Computation. Final manuscript received for publication October 5, 1998.
- Stephen N. Cole. Deterministic pushdown store machines and real-time computation. Journal of the ACM, 18(2):306-328, April 1971.
- Stephen N. Cole. Pushdown store machines and real-time computation. In Conference Record of ACM Symposium on Theory of Computing, pages 233-245, Marina del Rey, California, 5-7 May 1969.
- Clarence A. Ellis. The halting problem for probabilistic context-free generators. Journal of the ACM, 19(3):396-399, July 1972.
- Seymour Ginsburg and Michael A. Harrison. One-way nondeterministic real-time list-storage languages. Journal of the ACM, 15(3):428-446, July 1968.
- James N. Gray and Michael A. Harrison. On the covering and reduction problems for context-free grammars. Journal of the ACM, 19(4):675-698, October 1972.
- James N. Gray and Michael A. Harrison. Canonical precedence schemes. Journal of the ACM, 20(2):214-234, April 1973.
- Sheila A. Greibach. The hardest context-free language. SIAM Journal on Computing, 2(4):304-310, December 1973.
- Sheila A. Greibach. An infinite hierarchy of context-free languages. Journal of the ACM, 16(1):91-106, January 1969.
- Sheila Greibach and Seymour Ginsburg. Multitape AFA. Journal of the ACM, 19(2):193-221, April 1972.
- Michael A. Harrison and Ivan M. Havel. Real-time strict deterministic languages. SIAM Journal on Computing, 1(4):333-349, December 1972.
- Thomas N. Hibbard. Context-limited grammars. Journal of the ACM, 21(3):446-453, July 1974.
- David Bruce Lomet. A formalization of transition diagram systems. Journal of the ACM, 20(2):235-257, April 1973.
- Daniel J. Rosenkrantz. Matrix equations and normal forms for context-free grammars. Journal of the ACM, 14(3):501-507, July 1967.
- D. J. Rosenkrantz and R. E. Stearns. Properties of deterministic top down grammars. In Conference Record of ACM Symposium on Theory of Computing, pages 165-180, Marina del Rey, California, 5-7 May 1969.
- Fred Neil Springsteel. On the pre-AFL of [log n] space and related families of languages. Theoretical Computer Science, 2(3):295-304, September 1976.
Selected references
- Robert W. Floyd. Syntactic analysis and operator precedence. Journal of the ACM, 10(3):316-333, July 1963.
- Seymour Ginsburg and H. Gordon Rice. Two families of languages related to ALGOL. Journal of the ACM, 9(3):350-371, July 1962.