Continuous monoids and yields of infinite trees

M. Dauchet; E. Timmerman

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

  • Volume: 20, Issue: 3, page 251-274
  • ISSN: 0988-3754

How to cite

top

Dauchet, M., and Timmerman, E.. "Continuous monoids and yields of infinite trees." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.3 (1986): 251-274. <http://eudml.org/doc/92259>.

@article{Dauchet1986,
author = {Dauchet, M., Timmerman, E.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {monoid with partial order; yield of regular trees; infinite trees; set of words; tree alphabet; rational language},
language = {eng},
number = {3},
pages = {251-274},
publisher = {EDP-Sciences},
title = {Continuous monoids and yields of infinite trees},
url = {http://eudml.org/doc/92259},
volume = {20},
year = {1986},
}

TY - JOUR
AU - Dauchet, M.
AU - Timmerman, E.
TI - Continuous monoids and yields of infinite trees
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 3
SP - 251
EP - 274
LA - eng
KW - monoid with partial order; yield of regular trees; infinite trees; set of words; tree alphabet; rational language
UR - http://eudml.org/doc/92259
ER -

References

top
  1. 1. G. COMYN, Objets infinis calculables, Thèse d'État, Lille-I, mars 1982. 
  2. 2. B. COURCELLE, Frontiers of Infinite Trees, in R.A.I.R.O., Informatique Théorique, Vol. 12, 1978, pp. 319-337. Zbl0411.68065MR517634
  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. Zbl0418.68013MR553879
  4. 4. B. COURCELLE, Fundamental Properties of Infinite Trees, in Theoretical Computer Science, Vol. 25, 1983, pp. 95-169. Zbl0521.68013MR693076
  5. 5. M. DAUCHET and E. TIMMERMAN, Continuous Monoids and Yields of Infinite Trees, Technical report No. IT-74-85, Lille-I, juin 1985. Zbl0605.06012MR894714
  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. Zbl0433.68062MR581673
  7. 7. G. HUET, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, J. A.C.M., Vol. 27, 1980, pp. 797-821. Zbl0458.68007MR594700
  8. 8. MACNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 521-530. Zbl0212.33902MR213241
  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. Zbl0279.68010MR383813
  10. 10. M. NIVAT, Infinite Words, Infinite Trees, Infinite Computations, in Mathematical Centre Tracts, Vol. 109, 1979, pp. 1-52. Zbl0423.68012MR560292
  11. 11. M. NIVAT and D. PERRIN, "Ensembles reconnaissables de mots bi-infinis". Rapport LITP, 52, 1981. Zbl0589.68056
  12. 12. W. THOMAS, On Frontier of Regular Trees, (to appear this journal). 
  13. 13. E. TIMMERMAN, Yields of Infinite Trees, Proc. 9th CAAP, Bordeaux, 1984, in Cambridge University Press, pp. 199-311. Zbl0554.68051MR787468
  14. 14. E. TIMMERMAN, Feuillages d'arbres infinis, Thèse de 3e Cycle, Lille-I, juin 1984. 

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.