no. 4
Ogden's lemma for nonterminal bounded languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 4, pp. 457-471. 
@article{ITA_1986__20_4_457_0,
     author = {Boonyavatana, R. and Slutzki, G.},
     title = {Ogden's lemma for nonterminal bounded languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {457--471},
     publisher = {AFCET - Gauthier-Villars},
     address = {Paris},
     volume = {20},
     number = {4},
     year = {1986},
     mrnumber = {880847},
     zbl = {0631.68065},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1986__20_4_457_0/}
}
TY  - JOUR
AU  - Boonyavatana, R.
AU  - Slutzki, G.
TI  - Ogden's lemma for nonterminal bounded languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1986
SP  - 457
EP  - 471
VL  - 20
IS  - 4
PB  - AFCET - Gauthier-Villars
PP  - Paris
UR  - http://www.numdam.org/item/ITA_1986__20_4_457_0/
LA  - en
ID  - ITA_1986__20_4_457_0
ER  - 
%0 Journal Article
%A Boonyavatana, R.
%A Slutzki, G.
%T Ogden's lemma for nonterminal bounded languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1986
%P 457-471
%V 20
%N 4
%I AFCET - Gauthier-Villars
%C Paris
%U http://www.numdam.org/item/ITA_1986__20_4_457_0/
%G en
%F ITA_1986__20_4_457_0
Boonyavatana, R.; Slutzki, G. Ogden's lemma for nonterminal bounded languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 4, pp. 457-471. http://www.numdam.org/item/ITA_1986__20_4_457_0/

1. A. V. Aho, and J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Prentice-Hall, 1972. | MR

2. J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart 1979. | MR | Zbl

3. L. Boasson and S. Horváth, On languages satisfying Ogder's lemma, RAIRO Informatique Théorique, Vol. 12 (3), 1978, pp. 201-202. | Numdam | MR | Zbl

4. R. Boonyavatana and G. Slutzki, A pumping lemma for Nonterminal Bounded Languages, manuscript, 1984.

5. S. A. Greibach, Linearity is Polynomially Decidable for Realtime Pushdown Store Automata, Inform. Contr., Vol. 42, 1979, p. 27-37. | MR | Zbl

6. S. A. Greibach, The Unsolvability of the Recognition of Linear Context-Free Languages, JACM, Vol. 13, (4), 1966, pp. 582-587. | MR | Zbl

7. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass., 1978. | MR | Zbl

8. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory Languages and Computation, Addison-Wesley, Reading, Mass, 1979. | MR | Zbl

9. W. Ogden, A Helpful Result for Proving Inherent Ambiguity. Math. Syst Theory, Vol. 2 (3), pp. 191-194. | MR | Zbl