@article{ITA_1979__13_1_31_0, author = {Courcelle, Bruno}, title = {Arbres infinis et syst\`emes d'\'equations}, journal = {RAIRO. Informatique th\'eorique}, pages = {31--48}, publisher = {EDP-Sciences}, volume = {13}, number = {1}, year = {1979}, mrnumber = {525456}, zbl = {0406.68017}, language = {fr}, url = {http://www.numdam.org/item/ITA_1979__13_1_31_0/} }
Courcelle, Bruno. Arbres infinis et systèmes d'équations. RAIRO. Informatique théorique, Tome 13 (1979) no. 1, pp. 31-48. http://www.numdam.org/item/ITA_1979__13_1_31_0/
1. ADJ (Initial Algebra Semantics and Continuous Algebras, J. Assoc. Comput. Math., vol. 24, 1977, p. 68-95. | MR | Zbl
, , et ),2. The Metric Space of Infinite Trees, Algebraic and Topological Properties, Rapport Laboria n° 323, septembre 1978.
et ,3. The Existence and Construction of Free Iterative Theories, J. Comput. System Sc., vol. 12, 1976, p. 305-318. | MR | Zbl
et ,4. Topologie générale, 4e édition, Hermann, Paris.
,5. Algebraic Definition of Control Structures, Theor. Comput. Sc. (à paraître). | Zbl
,6. A Representation of Trees by Languages, II, Theor. Comput. Sc., vol. 7, 1978, p. 25-55. | MR | Zbl
,7. On Recursive Equations Having a Unique Solution, Communication au 19e Symp. on Foundations of Computer Science, Ann Arbor, 1978. | MR
,8. Algorithmes à'équivalence et de réduction à des expressions minimales dans une classe d'équations récursives simples, Proc. 2nd I.C.A.L.P., Saarbrücken, 1974 Lecture Notes in Computer Science, vol. 14, Springer-Verlag, p. 200-213. | MR | Zbl
, et ,9. Algebraic Families of Interpretations, 17th Symp. on Foundations of Computer Science, Houston, 1978 p. 137-146 et Rapport Laboria n° 189. | MR
et ,10. The Algebraic Semanticsof Recursive Program Schemes, Communication au Colloque Mathematical Foundation of Computer Science, 1978, in Lecture Notes in Computer Science, J. WINKOWSKI, éd., vol. 64, Springer-Verlag, p. 16-30. | MR | Zbl
et ,11. On the Algebraic Theory of Rooted Trees, J. Comput. System Sc., vol. 16, 1978, p. 362-399. | MR | Zbl
, et ,12. Résolution d'équations dans les langages d'ordre 1, 2, ..., ω, Thèse d'État, Université Paris-VII, 1976.
,13. Mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, vol. 11, 1977, p. 311-327. | Numdam | MR | Zbl
,14. Program Equivalence and Context-Free Grammars, J. Comput. System Sc., vol. 11, 1965, p. 358-374. | MR | Zbl
,15. Fixed-Points and Algebras with Infinitely Long Expressions I dans Mathematical Foundations of Computer Science, 1977, Lecture Notes in Comput, Sc, vol. 53, Springer-Verlag, 1977, p. 513-522. | MR | Zbl
,