EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 13 / No 1 (1979) RAIRO. Inform. théor., 13 1 (1979) 31-48 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 13, Number 1, 1979
Page(s) 31 - 48
DOI https://doi.org/10.1051/ita/1979130100311
Published online 01 February 2017
  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. [MR: 520711] [Zbl: 0359.68018] [Google Scholar]
  2. 2. A. ARNOLD et M. NIVAT, The Metric Space of Infinite Trees, Algebraic and Topological Properties, Rapport Laboria n° 323, septembre 1978. [Zbl: 0453.68021] [Google Scholar]
  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. [MR: 505399] [Zbl: 0333.68017] [Google Scholar]
  4. 4. N. BOURBAKI, Topologie générale, 4e édition, Hermann, Paris. [Google Scholar]
  5. 5. G. COUSINEAU, Algebraic Definition of Control Structures, Theor. Comput. Sc. (à paraître). [Zbl: 0456.68015] [Google Scholar]
  6. 6. B. COURCELLE, A Representation of Trees by Languages, II, Theor. Comput. Sc., vol. 7, 1978, p. 25-55. [MR: 495226] [Zbl: 0428.68088] [Google Scholar]
  7. 7. B. COURCELLE, On Recursive Equations Having a Unique Solution, Communication au 19e Symp. on Foundations of Computer Science, Ann Arbor, 1978. [MR: 539842] [Google Scholar]
  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. [MR: 428778] [Zbl: 0285.68022] [Google Scholar]
  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. [MR: 451817] [Google Scholar]
  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. [MR: 519827] [Zbl: 0384.68016] [Google Scholar]
  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. [MR: 496954] [Zbl: 0389.68007] [Google Scholar]
  12. 12. G. HUET, Résolution d'équations dans les langages d'ordre 1, 2, ..., ω, Thèse d'État, Université Paris-VII, 1976. [Google Scholar]
  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. [EuDML: 92059] [MR: 468353] [Zbl: 0371.68025] [Google Scholar]
  14. 14. B. ROSEN, Program Equivalence and Context-Free Grammars, J. Comput. System Sc., vol. 11, 1965, p. 358-374. [MR: 423889] [Zbl: 0315.68063] [Google Scholar]
  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. [MR: 483663] [Zbl: 0397.68086] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.