EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 20 / No 3 (1986) RAIRO-Theor. Inf. Appl., 20 3 (1986) 251-274 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 20, Number 3, 1986
Page(s) 251 - 274
DOI https://doi.org/10.1051/ita/1986200302511
Published online 01 February 2017
  1. 1. G. COMYN, Objets infinis calculables, Thèse d'État, Lille-I, mars 1982. [Google Scholar]
  2. 2. B. COURCELLE, Frontiers of Infinite Trees, in R.A.I.R.O., Informatique Théorique, Vol. 12, 1978, pp. 319-337. [EuDML: 92084] [MR: 517634] [Zbl: 0411.68065] [Google Scholar]
  3. 3. B. COURCELLE, Infinite Trees in Normal Form and Recursive Equations Having a Unique Sollution, Math. Systems Theory, Vol. 13, 1978, pp. 131-180. [MR: 553879] [Zbl: 0418.68013] [Google Scholar]
  4. 4. B. COURCELLE, Fundamental Properties of Infinite Trees, in Theoretical Computer Science, Vol. 25, 1983, pp. 95-169. [MR: 693076] [Zbl: 0521.68013] [Google Scholar]
  5. 5. M. DAUCHET and E. TIMMERMAN, Continuous Monoids and Yields of Infinite Trees, Technical report No. IT-74-85, Lille-I, juin 1985. [Zbl: 0605.06012] [MR: 894714] [Google Scholar]
  6. 6. S. HEILBRUNNER, An Algorithm for the Solution of Fixed Point Equations for Infinite Words, in R.A.I.R.O., Informatique Théorique, Vol. 14, 1980, pp. 131-141. [EuDML: 92120] [MR: 581673] [Zbl: 0433.68062] [Google Scholar]
  7. 7. G. HUET, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, J. A.C.M., Vol. 27, 1980, pp. 797-821. [MR: 594700] [Zbl: 0458.68007] [Google Scholar]
  8. 8. MACNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 521-530. [MR: 213241] [Zbl: 0212.33902] [Google Scholar]
  9. 9. M. NIVAT, Langages algébriques sur le magma libre et sémantique des schémas de programmes, in Automata, Languages and Programming, 1st Colloquium, Springer-Verlag, 1973, pp. 293-307. [MR: 383813] [Zbl: 0279.68010] [Google Scholar]
  10. 10. M. NIVAT, Infinite Words, Infinite Trees, Infinite Computations, in Mathematical Centre Tracts, Vol. 109, 1979, pp. 1-52. [MR: 560292] [Zbl: 0423.68012] [Google Scholar]
  11. 11. M. NIVAT and D. PERRIN, "Ensembles reconnaissables de mots bi-infinis". Rapport LITP, 52, 1981. [Zbl: 0589.68056] [Google Scholar]
  12. 12. W. THOMAS, On Frontier of Regular Trees, (to appear this journal). [Google Scholar]
  13. 13. E. TIMMERMAN, Yields of Infinite Trees, Proc. 9th CAAP, Bordeaux, 1984, in Cambridge University Press, pp. 199-311. [MR: 787468] [Zbl: 0554.68051] [Google Scholar]
  14. 14. E. TIMMERMAN, Feuillages d'arbres infinis, Thèse de 3e Cycle, Lille-I, juin 1984. [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.