Additional Key Words and Phrases: formal grammars, stack automata, formal languages, automata theory
Selected papers that cite this one
- W. Golubski and W. M. Lippe. Tree-stack automata. Mathematical Systems Theory, 29(3):227-244, May/June 1996.
- 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.
Selected references
- Alfred V. Aho. Indexed grammars -- an extension of context-free grammars. Journal of the ACM, 15(4):647-671, October 1968.
- Alfred V. Aho. Nested stack automata. Journal of the ACM, 16(3):383-406, July 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, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata. Journal of the ACM, 14(2):389-418, April 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.