@article{ITA_1977__11_4_311_0, author = {Nivat, Maurice}, title = {Mots infinis engendr\'es par une grammaire alg\'ebrique}, journal = {RAIRO. Informatique th\'eorique}, pages = {311--327}, publisher = {Centrale des revues, Dunod-Gauthier-Villars}, address = {Montreuil}, volume = {11}, number = {4}, year = {1977}, mrnumber = {468353}, zbl = {0371.68025}, 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. Informatique théorique PY - 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/ LA - fr ID - ITA_1977__11_4_311_0 ER -
Nivat, Maurice. Mots infinis engendrés par une grammaire algébrique. RAIRO. Informatique théorique, Tome 11 (1977) no. 4, pp. 311-327. http://www.numdam.org/item/ITA_1977__11_4_311_0/
1. 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 | Zbl
et ,2. Theories of Automata on ω-Tapes: a Simplified Approach, J. Comp. Syst. Sciences, vol. 8, 1974, p. 117-141. | MR | Zbl
,3. Theory of ω-Languages; Part I: Characterizations of ω-Context-Free Languagés, J. Comp. Syst. Sciences, vol. 15, 1977, p. 169-184. | MR | Zbl
et ,4. Automata, Languages and Machines, vol. A, Academic Press, New York, 1974. | MR | Zbl
,5. Testing and Generating Infinite Sequences by a Finite Automaton, Inf. and Control, vol. 9, 1966, p. 521-530. | MR | Zbl
,6. Push-Down Automata and Context-Free Languages, Inf. and Control, vol. 6, 1963, p. 246-264. | MR | Zbl
,