Advertisement

Decidability of yield's equality for infinite regular trees

  • Max Dauchet
  • Erick Timmerman
Part III Automata On Infinite Trees
Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)

Abstract

We introduce yield of infinite trees. Trees are provided with usual syntactic order, words with a new order that canonically makes concatenation continuous. "Yield" operation is continuous. Our main result consists in the decidability of yield's equality for infinite regular trees.

References

  1. [1]
    COMYN G. "OBJETS INFINIS CALCULABLES", Thèse d'Etat, LILLE Mars 1982Google Scholar
  2. [2]
    COURCELLE B. "FRONTIERS OF INFINITE TREES", In R.A.I.R.O. Informatique théorique, Vol. 12, pp. 319–337, 1978Google Scholar
  3. [3]
    COURCELLE B. "FUNDAMENTAL PROPERTIES OF INFINITE TREES" In Théoretical Computer Science, 25, pp. 95–169 1983Google Scholar
  4. [4]
    HEILBRUNNER S. "AN ALGORITHM FOR THE SOLUTION OF FIXED POINT EQUATIONS FOR INFINITE WORDS", In R.A.I.R.O. Informatique Théorique, Vol. 14, pp. 131–141, 1980Google Scholar
  5. [5]
    NIVAT M. "LANGAGES ALGEBRIQUES SUR LE MAGMA LIBRE ET SEMANTIQUE DES SCHEMAS DE PROGRAMMES", In Automata, Languages and Programming, 1rst Colloquium, Springer Verlag, pp. 293–307, 1973Google Scholar
  6. [6]
    NIVAT M. "SUR LES ENSEMBLES DE MOTS INFINIS ENGENDRES PAR UNE GRAMMAIRE ALGEBRIQUE", In R.A.I.R.O., Informatique Théorique, Vol. 12, pp. 259–278, 1978Google Scholar
  7. [7]
    NIVAT M. "INFINITE WORDS, INFINITE TREES, INFINITE COMPUTATIONS" In Mathematical entre Tracts, Vol. 109, pp. 1–52, 1979Google Scholar
  8. [8]
    NIVAT M., PERRIN D. "ENSEMBLES RECONNAISSABLES DE MOTS BI-INFINIS" Rapport L.I.T.P., 52, 1981Google Scholar
  9. [9]
    TIMMERMAN E. "YIELDS OF INFINITE TREES", Proc. 9th C.A.A.P. BORDEAUX, 1984Google Scholar
  10. [10]
    TIMMERMAN E. "FEUILLAGES D'ARBRES INFINIS" Thèse de 3ème Cycle, LILLE, Juin 1984Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Max Dauchet
    • 1
  • Erick Timmerman
    • 1
  1. 1.Laboratoire d'INFORMATIQUE FONDAMENTALE de LILLE (L.A. 369 associé au C.N.R.S.)UNIVERSITE DE LILLE-IVILLENEUVE D'ASCQ Cédex

Personalised recommendations