Geodesic
On languages satisfying Ogden's lemma
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978) no. 3, pp. 201-202.

Voir la notice de l'article provenant de la source Numdam

@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},
     pages = {201--202},
     publisher = {EDP-Sciences},
     volume = {12},
     number = {3},
     year = {1978},
     mrnumber = {510637},
     zbl = {0387.68054},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1978__12_3_201_0/}
}
TY  - JOUR
AU  - Boasson, L.
AU  - Horváth, S.
TI  - On languages satisfying Ogden's lemma
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1978
SP  - 201
EP  - 202
VL  - 12
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1978__12_3_201_0/
LA  - en
ID  - ITA_1978__12_3_201_0
ER  - 
%0 Journal Article
%A Boasson, L.
%A Horváth, S.
%T On languages satisfying Ogden's lemma
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1978
%P 201-202
%V 12
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1978__12_3_201_0/
%G en
%F 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) no. 3, pp. 201-202. http://geodesic.mathdoc.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. | Zbl | MR

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. | Zbl | MR

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

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

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

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. | Zbl | mathdoc-id

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