Arbres infinis et systèmes d'équations

Bruno Courcelle

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1979)

  • Volume: 13, Issue: 1, page 31-48
  • ISSN: 0988-3754

How to cite

top

Courcelle, Bruno. "Arbres infinis et systèmes d'équations." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.1 (1979): 31-48. <http://eudml.org/doc/92088>.

@article{Courcelle1979,
author = {Courcelle, Bruno},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Programming Schemes; Metric Compact Magma; Category of Magmas; Systems of Equations; Formal Power Series},
language = {fre},
number = {1},
pages = {31-48},
publisher = {EDP-Sciences},
title = {Arbres infinis et systèmes d'équations},
url = {http://eudml.org/doc/92088},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Courcelle, Bruno
TI - Arbres infinis et systèmes d'équations
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 1
SP - 31
EP - 48
LA - fre
KW - Programming Schemes; Metric Compact Magma; Category of Magmas; Systems of Equations; Formal Power Series
UR - http://eudml.org/doc/92088
ER -

References

top
  1. 1. ADJ ( J. GOGUEN, J. THATCHER, E. WAGNER et J. WRIGHT), Initial Algebra Semantics and Continuous Algebras, J. Assoc. Comput. Math., vol. 24, 1977, p. 68-95. Zbl0359.68018MR520711
  2. 2. A. ARNOLD et M. NIVAT, The Metric Space of Infinite Trees, Algebraic and Topological Properties, Rapport Laboria n° 323, septembre 1978. Zbl0453.68021
  3. 3. S. BLOOM et C. ELGOT, The Existence and Construction of Free Iterative Theories, J. Comput. System Sc., vol. 12, 1976, p. 305-318. Zbl0333.68017MR505399
  4. 4. N. BOURBAKI, Topologie générale, 4e édition, Hermann, Paris. 
  5. 5. G. COUSINEAU, Algebraic Definition of Control Structures, Theor. Comput. Sc. (à paraître). Zbl0456.68015
  6. 6. B. COURCELLE, A Representation of Trees by Languages, II, Theor. Comput. Sc., vol. 7, 1978, p. 25-55. Zbl0428.68088MR495226
  7. 7. B. COURCELLE, On Recursive Equations Having a Unique Solution, Communication au 19e Symp. on Foundations of Computer Science, Ann Arbor, 1978. MR539842
  8. 8. B. COURCELLE, G. KAHN et J. VUILLEMIN, 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. Zbl0285.68022MR428778
  9. 9. B. COURCELLE et M. NIVAT, Algebraic Families of Interpretations, 17th Symp. on Foundations of Computer Science, Houston, 1978 p. 137-146 et Rapport Laboria n° 189. MR451817
  10. 10. B. COURCELLE et M. NIVAT, 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. Zbl0384.68016MR519827
  11. 11. C. ELGOT, S. BLOOM et R. TINDELL, On the Algebraic Theory of Rooted Trees, J. Comput. System Sc., vol. 16, 1978, p. 362-399. Zbl0389.68007MR496954
  12. 12. G. HUET, Résolution d'équations dans les langages d'ordre 1, 2, ..., ω, Thèse d'État, Université Paris-VII, 1976. 
  13. 13. M. NIVAT, Mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, vol. 11, 1977, p. 311-327. Zbl0371.68025MR468353
  14. 14. B. ROSEN, Program Equivalence and Context-Free Grammars, J. Comput. System Sc., vol. 11, 1965, p. 358-374. Zbl0315.68063MR423889
  15. 15. J. TIURYN, 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. Zbl0397.68086MR483663

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.