On languages satisfying Ogden's lemma
Boasson, L. ; Horváth, S.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978), p. 201-202 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1978__12_3_201_0,
     author = {Boasson, L. and Horv\'ath, S.},
     title = {On languages satisfying Ogden's lemma},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {12},
     year = {1978},
     pages = {201-202},
     mrnumber = {510637},
     zbl = {0387.68054},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1978__12_3_201_0}
}

Boasson, L.; Horváth, S. On languages satisfying Ogden's lemma. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978) pp. 201-202. http://gdmltest.u-ga.fr/item/ITA_1978__12_3_201_0/

1. J. M. Autebert, L. Boasson and G. Cousineau, A Note on 1-Locally Linear Language, Information and Control, Vol. 37, No. 1, 1978, p. 1-4. | MR 483732 | Zbl 0377.68045

2. Y. Bar-Hille, M. Perles and E. Shamir, On Formal Proper des of Simple Phrase Structure Grammars, Zeitschr. Phonetik., Sprachwiss., Vol. 14, 1961, p. 143-172. | MR 151376 | Zbl 0106.34501

3. W. Ogden, A Helpful Resuit for Proving Inherent Ambiguity, Math. System Theory, Vol. 2, No. 3, 1968, p. 191-194. | MR 233645 | Zbl 0175.27802

4. A. V. Aho and J. D. Ullman, The Theory of Parsing, Translationand Compiling, Vol. I Parsing, Prentice-Hall, 1971. | MR 408321

5. A. Salomaa, Formal Language, Academic Press, New York, London, 1973. | MR 438755

6. S. Horváth, The Family of Languages Satisfying Bar-Hillel's Lemma, this issue of the R.A.I.R.O., Informatique théorique. | Numdam | Zbl 0387.68053

7. D. Wise, A Strong Pumping Lemma for Context-Free Languages, Theoretical Computer Science, Vol. 3 1976, p. 359-369. | MR 464754 | Zbl 0359.68091