Rabin tree automata and finite monoids

  • Danièle Beauquier
  • Andreas Podelski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 711)


We incorporate finite monoids into the theory of Rabin recognizability of infinite tree languages. We define a free monoid of infinite trees and associate with each infinite tree language L a language L of infinite words over this monoid. Using this correspondence we introduce strong monoid recognizability of infinite tree languages (strengthening the standard notion for infinite words) and show that it is equivalent to Rabin recognizability. We also show that there exists an infinite tree language L which is not Rabin recognizable, but its associated language L is monoid recognizable (in the standard sense). Our positive result opens the theory of varieties of infinite tree languages, extending those for finite and infinite words and finite trees.


Pointed Tree Tree Automaton Tree Language Canonical Morphism Free Monoid 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bu62]
    John R. Büchi “On a decision method in restricted second order arithmetic”. In Erich Nagel et al., editors, Logic, Methodology, and Philosophy of Science, pages 1–11. Stanford Univ. Press, 1960.Google Scholar
  2. [Eil76]
    Samuel Eilenberg. Automata, Language and Machine, volume B of Applied and Pure Mathematics. Academic Press, 1976.Google Scholar
  3. [KT90]
    Dexter Kozen and Jerzy Tiuryn. “Logics of programs”. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Sience, volume B, chapter 4, pages 789–840. Elsevier, 1990.Google Scholar
  4. [NP89]
    Maurice Nivat and Andreas Podelski. “Tree Monoids and Recognizable Sets of Trees”. In Hassan Aït-Kaci and Maurice Nivat, editors, Resolution of Equations in Algebraic Structures, Vol. 1 (Academic Press, London, 1989).Google Scholar
  5. [NP92]
    Maurice Nivat and Andreas Podelski, editors. Tree Automata, Advances and Open Problems. Elsevier Science, 1992.Google Scholar
  6. [Pec87]
    Jean-Pierre Pécuchet. “Etude syntaxique des parties reconnaissables de mots infinis”. In Laurent Kott, editor, Proc. 13th ICALP, LNCS 226, pages 294–303, 1987.Google Scholar
  7. [PP92]
    Pierre Peladeau and Andreas Podelski. “On Reverse and General Definite Tree Languages”. In Proc. 18th ICALP, LNCS. 1992.Google Scholar
  8. [Per84]
    Dominique Perrin. “Recent results on automata and infinite words”. In M.P. Chytil and V. Koubek, editors, Math. Found. of Comp. Sci., LNCS 176, pages 134–148.1984.Google Scholar
  9. [Pi84]
    Jean-Eric Pin, Variétés de langages formels, Masson, Paris, 1984, and Varieties of Formal Langages, Plenum, London, 1986.Google Scholar
  10. [Rab69]
    Michael O. Rabin. “Decidability of second-order theories and automata on infinite trees”. Trans. Amer. Math. Soc. 141, pages 1–35.1969.Google Scholar
  11. [Rab77]
    Michael O. Rabin. “Decidable theories”. In John Barwise, editor, Handbook of Mathematical Logic, pages 595–630. North-Holland, 1977.Google Scholar
  12. [Stei92]
    Magnus Steinby, “A Theory of Tree Language Varieties”. In Maurice Nivat and Andreas Podelski, editors, Tree Automata, Advances and Open Problems. Elsevier Science, 1992.Google Scholar
  13. [Tho84]
    Wolfgang Thomas. “Logical aspects in the study of tree languages”, In Bruno Courcelle, editor, Proc. Ninth Coll. Trees in Algebra and in Programming, pages 31–49. Cambridge Univers. Press, Cambridge, 1984.Google Scholar
  14. [Tho90]
    Wolfgang Thomas. “Automata on infinite objects”. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Sience, volume B, chapter 4, pages 133–161. Elsevier, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Danièle Beauquier
    • 1
  • Andreas Podelski
    • 2
  1. 1.Institut Biaise Pascal (IBP)LITPParis Cedex 05France
  2. 2.Paris Research Laboratory (PRL)Digital Equipment CorporationRueil-MalmaisonFrance

Personalised recommendations