Journal of the ACM Bibliography
Alfred
V. Aho. Indexed grammars -- an extension of context-free grammars.
Journal of the ACM, 15(4):647-671, October 1968.
[BibTeX entry]
Selected papers that cite this one
- Alfred V. Aho. Nested stack
automata. Journal of the ACM, 16(3):383-406, July 1969.
- A. Ehrenfeucht, G. Rozenberg, and S. Skyum. A relationship
between ET0L and EDT0L languages. Theoretical Computer
Science, 1(4):325-330, April 1976.
- Robert H. Gilman. A shrinking lemma for
indexed languages. Theoretical Computer Science,
163(1-2):277-281, 30 August 1996. Note.
- 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.
- M. A. Palis and S. M. Shende. Pumping lemmas for the
control language hierarchy. Mathematical Systems
Theory, 28(3):199-213, May/June 1995.
- Kai Salomaa. Yield-languages of
two-way pushdown tree automata. Information Processing
Letters, 58(4):195-199, 27 May 1996.
- James W. Thatcher. Transformations and
translations from the point of view of generalized finite automata
theory. In Conference Record of ACM Symposium on Theory of
Computing, pages 129-142, Marina del Rey, California, 5-7 May
1969.
- K. Vijay-Shanker and D. J. Weir. The equivalence of
four extensions of context-free grammars. Mathematical Systems
Theory, 27(6):511-546, November/December 1994.
Selected references
- 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.
- 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.
- Daniel J. Rosenkrantz. Programmed grammars: A
new device for generating formal languages. In Conference
Record of 1967 Eighth Annual Symposium on Switching and Automata
Theory, pages 14-20, Austin, Texas, 18-20 October 1967. IEEE.
Shortcuts: