@article{ITA_1978__12_3_201_0, author = {Boasson, L. and Horv\'ath, S.}, title = {On languages satisfying {Ogden's} lemma}, journal = {RAIRO. Informatique th\'eorique}, pages = {201--202}, publisher = {EDP-Sciences}, volume = {12}, number = {3}, year = {1978}, mrnumber = {510637}, zbl = {0387.68054}, language = {en}, url = {http://www.numdam.org/item/ITA_1978__12_3_201_0/} }
Boasson, L.; Horváth, S. On languages satisfying Ogden's lemma. RAIRO. Informatique théorique, Tome 12 (1978) no. 3, pp. 201-202. http://www.numdam.org/item/ITA_1978__12_3_201_0/
1. A Note on 1-Locally Linear Language, Information and Control, Vol. 37, No. 1, 1978, p. 1-4. | MR | Zbl
, and ,2. On Formal Proper des of Simple Phrase Structure Grammars, Zeitschr. Phonetik., Sprachwiss., Vol. 14, 1961, p. 143-172. | MR | Zbl
, and ,3. A Helpful Resuit for Proving Inherent Ambiguity, Math. System Theory, Vol. 2, No. 3, 1968, p. 191-194. | MR | Zbl
,4. The Theory of Parsing, Translationand Compiling, Vol. I Parsing, Prentice-Hall, 1971. | MR
and ,5. Formal Language, Academic Press, New York, London, 1973. | MR
,6. The Family of Languages Satisfying Bar-Hillel's Lemma, this issue of the R.A.I.R.O., Informatique théorique. | Numdam | Zbl
,7. A Strong Pumping Lemma for Context-Free Languages, Theoretical Computer Science, Vol. 3 1976, p. 359-369. | MR | Zbl
,