Frontiers of infinite trees
Courcelle, Bruno
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978), p. 319-337 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1978__12_4_319_0,
     author = {Courcelle, Bruno},
     title = {Frontiers of infinite trees},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {12},
     year = {1978},
     pages = {319-337},
     mrnumber = {517634},
     zbl = {0411.68065},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1978__12_4_319_0}
}

Courcelle, Bruno. Frontiers of infinite trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978) pp. 319-337. http://gdmltest.u-ga.fr/item/ITA_1978__12_4_319_0/

1. B. Courcelle, A Representation of Trees by Languages, Theoretical Computer Science Vol. 7, 1978, pp. 25-55. | MR 495226 | Zbl 0428.68088

2. B. Courcelle and M. Nivat, Algebraic Families of Interpretations, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 137-146. | MR 451817

3. S. Heilbrunner, Gleichungssysteme für Zeichenreihen, Technische Universität München, Bericht Nr. 7311, 1973.

4. D. Lehmann, Categories for Fixpoint Semantics, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 122-126. | MR 474955

5. R. Mcnaughton, Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 311-327. | MR 213241 | Zbl 0212.33902

6. M. Nivat, Mots infinis engendrés par une grammaire algébrique, this journal, Vol. 11, 1977, pp. 311-327. | Numdam | MR 468353 | Zbl 0371.68025

7. M. Nivat, Éléments de la théorie générale des Codes, in Automata Theory, E. R. CAIANIELLO, ed., Academic Press 1966, pp. 278-294. | MR 241168 | Zbl 0208.45101

8. J. W. Thatcher, Generalized Sequential Machines Maps, J. Comput. System Sci., Vol. 4, 1970, pp. 339-367. | MR 302335 | Zbl 0198.03303