Additional Key Words and Phrases: programmed grammar, formal language, phrase structure grammar, context-free, context-sensitive, Turing machines
Selected papers that cite this one
- Ronald V. Book. Terminal context in context-sensitive grammars. SIAM Journal on Computing, 1(1):20-30, March 1972.
- Guozhu Dong. On the index of positive programmed formal languages. Information Processing Letters, 54(2):105-110, 28 April 1995.
- Andrzej Ehrenfeucht, Gheorghe P\u{a}un, and Grzegorz Rozenberg. On representing recursively enumerable languages by internal contextual languages. Theoretical Computer Science, 205(1-2):61-83, 28 September 1998.
- M. A. Palis and S. M. Shende. Pumping lemmas for the control language hierarchy. Mathematical Systems Theory, 28(3):199-213, May/June 1995.
Selected references
- Alfred V. Aho. Indexed grammars -- an extension of context free grammars. In Conference Record of 1967 Eighth Annual Symposium on Switching and Automata Theory, pages 21-31, Austin, Texas, 18-20 October 1967. IEEE.
- Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-167, June 1959.
- D. J. Farber, R. E. Griswold, and I. P. Polonsky. SNOBOL, a string manipulation language. Journal of the ACM, 11(1):21-30, January 1964.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata. Journal of the ACM, 14(2):389-418, April 1967.
- S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and Control, 7(2):207-223, June 1964.
- Peter S. Landweber. Three theorems on phrase structure grammars of type 1. Information and Control, 6(2):131-136, June 1963.
- R. E. Stearns, J. Hartmanis, and P. M. Lewis II. Hierarchies of memory limited computations. In Proceedings of the Sixth Annual Symposium on Switching Circuit Theory and Logical Design, pages 179-190. IEEE, 1965.