Additional Key Words and Phrases: formal grammars, bracketed grammars, formal languages, recursively enumerable languages, stack automata
Selected papers that cite this one
- Walter J. Savitch. How to make arbitrary grammars look like context-free grammars. SIAM Journal on Computing, 2(3):174-182, September 1973.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata. Journal of the ACM, 14(2):389-418, April 1967.
- 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.