Mots infinis engendrés par une grammaire algébrique
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) no. 4, pp. 311-327.
@article{ITA_1977__11_4_311_0,
     author = {Nivat, Maurice},
     title = {Mots infinis engendr\'es par une grammaire alg\'ebrique},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {311--327},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {4},
     year = {1977},
     zbl = {0371.68025},
     mrnumber = {468353},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1977__11_4_311_0/}
}
TY  - JOUR
AU  - Nivat, Maurice
TI  - Mots infinis engendrés par une grammaire algébrique
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1977
DA  - 1977///
SP  - 311
EP  - 327
VL  - 11
IS  - 4
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://www.numdam.org/item/ITA_1977__11_4_311_0/
UR  - https://zbmath.org/?q=an%3A0371.68025
UR  - https://www.ams.org/mathscinet-getitem?mr=468353
LA  - fr
ID  - ITA_1977__11_4_311_0
ER  - 
Nivat, Maurice. Mots infinis engendrés par une grammaire algébrique. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) no. 4, pp. 311-327. http://www.numdam.org/item/ITA_1977__11_4_311_0/

1. A. Arnold et M. Nivat, Non-Deterministic Recursive Program Schemes, à paraitre dans Fundamentals of Computation Theory, Lecture Notes in Computer Science, n° 56, p. 12-21, Springer Verlag, 1977. | MR 502120 | Zbl 0361.68020

2. Y. Choueka, Theories of Automata on ω-Tapes: a Simplified Approach, J. Comp. Syst. Sciences, vol. 8, 1974, p. 117-141. | MR 342378 | Zbl 0292.02033

3. R. Cohen et A. Gold, Theory of ω-Languages; Part I: Characterizations of ω-Context-Free Languagés, J. Comp. Syst. Sciences, vol. 15, 1977, p. 169-184. | MR 483741 | Zbl 0363.68113

4. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974. | MR 530382 | Zbl 0317.94045

5. R. Mcnaughton, Testing and Generating Infinite Sequences by a Finite Automaton, Inf. and Control, vol. 9, 1966, p. 521-530. | MR 213241 | Zbl 0212.33902

6. M. P. Schützenberger, Push-Down Automata and Context-Free Languages, Inf. and Control, vol. 6, 1963, p. 246-264. | MR 163809 | Zbl 0123.12502