Abstract
We consider the monadic second order logic with two suc- cessor functions and equality, interpreted on the binary tree. We show that a set of assignments is definable in the fragment ∑2 of this logic if and only if it is definable by a Büchi automaton. Moreover we show that every set of second order assignments definable in ∑2 with equality is definable in ∑2 without equality as well. The present paper is sketchy due to space constraints; for more details and proofs see [7].
Supported by a CNR grant. The author thanks also the LaBRI for support. Laboratoire Bordelais de Recherche en Informatique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, A., Niwiński, D.: Fixed point characterization of Büchi automata on infinite trees, J. Inf. Process. Cybern. EIK 26 (1990) 451–459
Büchi, J. R.: On a decision method in restricted second order arithmetic, in: E. Nagel et al., eds., Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science (Stanford Univ. Press, Stanford, CA, 1960), 1–11
Fagin, R.: Generalized first order spectra and polynomial time recognizable sets, in: Complexity of computation, volume 7, SIAM-AMS, 1974
Hafer, T.: On the boolean closure of Büchi tree automaton definable sets of ω-trees,Technical report, Aachener Infor. Ber. Nr. 87-16, RWTH Aachen, 1987
Janin, D., Lenzi, G.: On the structure of the monadic logic of the binary tree, in: Proceedings of the conference MFCS’99, Lecture Notes in Computer Science n. 1672, 310–320
Kozen, D.: Results on the propositional μ-calculus, Theoretical Computer Science 27 (1983) 333–354
Lenzi, G.: A second order characterization of Büchi automata, submitted to the Annals of Pure and Applied Logic (a draft version is available via email, please contact the author)
Rabin, M.: Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969) 1–35
Rabin, M.: Weakly definable relations and special automata, in: Y. Bar-Hillel, ed., Mathematical Logic and Foundations of Set theory (North-Holland, Amsterdam 1970), 1–23
Skurczyński, J.: A characterization of Büchi tree automata, unpublished manuscript, University of Gdańsk, 2000
Walukiewicz, I.: Monadic second order logic on tree-like structures, in: Proceedings of the conference STACS’96, Lecture Notes in Computer Science n. 1046, 401–414
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lenzi, G. (2001). A New Logical Characterization of Büchi Automata. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_41
Download citation
DOI: https://doi.org/10.1007/3-540-44693-1_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41695-1
Online ISBN: 978-3-540-44693-4
eBook Packages: Springer Book Archive