Journal of the ACM Bibliography

Additional Key Words and Phrases: automata, formal languages, indexed languages, pushdown automata, stack automata, acceptors, balloon automata, closure properties, dedidability results, list storage

Selected papers that cite this one

• Robert H. Gilman. A shrinking lemma for indexed languages. Theoretical Computer Science, 163(1-2):277-281, 30 August 1996. Note.

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

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

Selected references

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

• A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Time and tape complexity of pushdown automaton languages. Information and Control, 13(3):186-206, September 1968.

• Seymour Ginsburg and Sheila Greibach. Abstract families of languages. In Conference Record of 1967 Eighth Annual Symposium on Switching and Automata Theory, pages 128-139, Austin, Texas, 18-20 October 1967. IEEE.

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

• 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, Michael A. Harrison, and Oscar H. Ibarra. Two-way pushdown automata. Information and Control, 11(1/2):30-70, July-August 1967.

• Sheila Greibach. Checking automata and one-way stack languages (extended abstract). In Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, pages 287-291, Schenectady, New York, 15-18 October 1968. IEEE.

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

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

• Donald E. Knuth and Richard H. Bigelow. Programming language for automata. Journal of the ACM, 14(4):615-635, October 1967.

• Mario Schkolnick. Two-type bracketed grammars. In Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, pages 315-326, Schenectady, New York, 15-18 October 1968. IEEE.

Shortcuts: