Voir la notice de l'article provenant de la source Numdam
@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}, pages = {319--337}, publisher = {EDP-Sciences}, volume = {12}, number = {4}, year = {1978}, mrnumber = {517634}, zbl = {0411.68065}, language = {en}, url = {http://geodesic.mathdoc.fr/item/ITA_1978__12_4_319_0/} }
TY - JOUR AU - Courcelle, Bruno TI - Frontiers of infinite trees JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1978 SP - 319 EP - 337 VL - 12 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1978__12_4_319_0/ LA - en ID - ITA_1978__12_4_319_0 ER -
Courcelle, Bruno. Frontiers of infinite trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 12 (1978) no. 4, pp. 319-337. http://geodesic.mathdoc.fr/item/ITA_1978__12_4_319_0/
1. A Representation of Trees by Languages, Theoretical Computer Science Vol. 7, 1978, pp. 25-55. | Zbl | MR
,2. Algebraic Families of Interpretations, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 137-146. | MR
and ,3. Gleichungssysteme für Zeichenreihen, Technische Universität München, Bericht Nr. 7311, 1973.
,4. Categories for Fixpoint Semantics, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 122-126. | MR
,5. Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 311-327. | Zbl | MR
,6. Mots infinis engendrés par une grammaire algébrique, this journal, Vol. 11, 1977, pp. 311-327. | Zbl | MR | mathdoc-id
,7. Éléments de la théorie générale des Codes, in Automata Theory, E. R. CAIANIELLO, ed., Academic Press 1966, pp. 278-294. | Zbl | MR
,8. Generalized Sequential Machines Maps, J. Comput. System Sci., Vol. 4, 1970, pp. 339-367. | Zbl | MR
,