Journal of the ACM Bibliography

Selected papers that cite this one

• Alfred V. Aho. Nested stack automata. Journal of the ACM, 16(3):383-406, July 1969.

• Alfred V. Aho. Indexed grammars -- an extension of context-free grammars. Journal of the ACM, 15(4):647-671, October 1968.

• 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.

• 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 and Michael A. Harrison. One-way nondeterministic real-time list-storage languages. Journal of the ACM, 15(3):428-446, July 1968.

• W. Golubski and W. M. Lippe. Tree-stack automata. Mathematical Systems Theory, 29(3):227-244, May/June 1996.

• 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 Mario Schkolnick. A grammatical characterization of one-way nondeterministic stack languages. Journal of the ACM, 18(2):148-172, April 1971.

• J. E. Hopcroft and J. D. Ullman. Decidable and undecidable questions about automata. Journal of the ACM, 15(2):317-324, April 1968.

• Oscar H. Ibarra, Sartaj K. Sahni, and Chul E. Kim. Finite automata with mutliplication. Theoretical Computer Science, 2(3):271-294, September 1976.

• William F. Ogden. Intercalation theorems for stack languages. In Conference Record of ACM Symposium on Theory of Computing, pages 31-42, Marina del Rey, California, 5-7 May 1969.

• Daniel J. Rosenkrantz. Programmed grammars and classes of formal languages. Journal of the ACM, 16(1):107-131, January 1969.

• Eugene S. Santos. A note on bracketed grammars. Journal of the ACM, 19(2):222-224, April 1972.

• Walter J. Savitch. How to make arbitrary grammars look like context-free grammars. SIAM Journal on Computing, 2(3):174-182, September 1973.

• J. D. Ullman. Halting stack automata. Journal of the ACM, 16(4):550-563, October 1969.

Selected references

• Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-167, June 1959.

• Seymour Ginsburg and Sheila A. Greibach. Deterministic context free languages. Information and Control, 9(6):620-648, December 1966.

• Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. Stack automata and compiling. Journal of the ACM, 14(1):172-201, January 1967.

Shortcuts: