Mots infinis engendres par une grammaire algébrique. (French) Zbl 0371.68025


68Q45 Formal languages and automata
Full Text: EuDML


[1] 1. A. ARNOLD et M. NIVAT, Non-Deterministic Recursive Program Schemes, à paraitre dans Fundamentals of Computation Theory, Lecture Notes in Computer Science, n^\circ 56, p. 12-21, Springer Verlag, 1977. Zbl0361.68020 MR502120 · Zbl 0361.68020
[2] 2. Y. CHOUEKA, Theories of Automata on \omega -Tapes: a Simplified Approach, J. Comp. Syst. Sciences, vol. 8, 1974, p. 117-141. Zbl0292.02033 MR342378 · Zbl 0292.02033
[3] 3. R. COHEN et A. GOLD, Theory of \omega -Languages; Part I: Characterizations of \omega -Context-Free Languagés, J. Comp. Syst. Sciences, vol. 15, 1977, p. 169-184. Zbl0363.68113 MR483741 · Zbl 0363.68113
[4] 4. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974. Zbl0317.94045 MR530382 · Zbl 0317.94045
[5] 5. R. MCNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Inf. and Control, vol. 9, 1966, p. 521-530. Zbl0212.33902 MR213241 · Zbl 0212.33902
[6] 6. M. P. SCHÜTZENBERGER, Push-Down Automata and Context-Free Languages, Inf. and Control, vol. 6, 1963, p. 246-264. Zbl0123.12502 MR163809 · Zbl 0123.12502
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.