Mots infinis engendrés par une grammaire algébrique
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1977)
- Volume: 11, Issue: 4, page 311-327
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 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. Zbl0361.68020MR502120
- 2. Y. CHOUEKA, Theories of Automata on ω-Tapes: a Simplified Approach, J. Comp. Syst. Sciences, vol. 8, 1974, p. 117-141. Zbl0292.02033MR342378
- 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. Zbl0363.68113MR483741
- 4. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974. Zbl0317.94045MR530382
- 5. R. MCNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Inf. and Control, vol. 9, 1966, p. 521-530. Zbl0212.33902MR213241
- 6. M. P. SCHÜTZENBERGER, Push-Down Automata and Context-Free Languages, Inf. and Control, vol. 6, 1963, p. 246-264. Zbl0123.12502MR163809
Citations in EuDML Documents
top- Bruno Courcelle, Arbres infinis et systèmes d'équations
- Maurice Nivat, Sur les ensembles de mots infinis engendrés par une grammaire algébrique
- Bruno Courcelle, Frontiers of infinite trees
- André Arnold, Sémantique des processus communicants
- Michel Latteux, Mots infinis et langages commutatifs
- Stephan Heilbrunner, An algorithm for the solution of fixed-point equations for infinite words
- Olivier Finkel, Highly Undecidable Problems For Infinite Computations
- B. Courcelle, Algebraic and Regular Trees