Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Samuel Eilenberg. Automata, Language and Machine, volume B of Applied and Pure Mathematics. Academic Press, 1976.
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.
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).
Maurice Nivat and Andreas Podelski, editors. Tree Automata, Advances and Open Problems. Elsevier Science, 1992.
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.
Pierre Peladeau and Andreas Podelski. “On Reverse and General Definite Tree Languages”. In Proc. 18th ICALP, LNCS. 1992.
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.
Jean-Eric Pin, Variétés de langages formels, Masson, Paris, 1984, and Varieties of Formal Langages, Plenum, London, 1986.
Michael O. Rabin. “Decidability of second-order theories and automata on infinite trees”. Trans. Amer. Math. Soc. 141, pages 1–35.1969.
Michael O. Rabin. “Decidable theories”. In John Barwise, editor, Handbook of Mathematical Logic, pages 595–630. North-Holland, 1977.
Magnus Steinby, “A Theory of Tree Language Varieties”. In Maurice Nivat and Andreas Podelski, editors, Tree Automata, Advances and Open Problems. Elsevier Science, 1992.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, D., Podelski, A. (1993). Rabin tree automata and finite monoids. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_18
Download citation
DOI: https://doi.org/10.1007/3-540-57182-5_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57182-7
Online ISBN: 978-3-540-47927-7
eBook Packages: Springer Book Archive