A shrinking lemma for indexed languages

Theoretical Computer Science

Volumn 163, Issue 1-2, 1996, Pages 277-281

  Gilman, Robert H ^a  

^a Stevens Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CONTEXT FREE LANGUAGES; THEOREM PROVING;

INDEXED LANGUAGES; PUMPING LEMMA; STACK LANGUAGES;

COMPUTATIONAL LINGUISTICS;

EID: 0030215992     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00244-7     Document Type: Article

References (6)

1. A. Aho, Indexed grammars - an extension of context-free grammars, J. ACM 15 (1968) 647-671.
2. A. Aho, Nested stack automata, J. ACM 16 (1969) 383-406.
3. T. Hayashi, On derivation trees of indexed grammars: an extension of the uvwxy-theorem, Publ. RIMS Kyoto Univ. 9 (1973) 61-92.
4. J.E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1979).
5. W. Ogden, Intercalation theorems for stack languages, Proc. 1st Annual ACM Symp. on the Theory of Computing (1969) 31-42.
6. J. Sakarovitch and I. Simon, Subwords, in: M. Lothaire, ed., Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, Vol. 17 (Addison Wesley, Reading, MA, 1983) 105-142.