Abstract
We study the expressive power of the logics EF + F − 1, Δ 2 and boolean combinations of Σ 1 over ranked trees. In particular, we provide effective characterizations of those three logics using algebraic identities. Characterizations had already been obtained for those logics over unranked trees, but both the algebra and the proofs were dependant on the properties of the unranked structure and the problem remained open for ranked trees.
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
Benedikt, M., Segoufin, L.: Regular tree languages definable in FO. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 327–339. Springer, Heidelberg (2005)
Bojańczyk, M.: Two-way unary temporal logic over trees. In: 22nd IEEE Symposium on Logic in Computer Science, pp. 121–130 (2007)
Bojańczyk, M., Segoufin, L.: Tree languages defined in first-order logic with one quantifier alternation (2008)
Bojańczyk, M., Walukiewicz, I.: Characterizing EF and EX tree logics. Theoritical Compututer Science 358(2-3), 255–272 (2006)
Bojańczyk, M., Walukiewicz, I.: Forest algebras. In: Automata and Logic: History and Perspectives, pp. 107–132. Amsterdam University Press, Amsterdam (2007)
Vardi, M.Y., Etessami, K., Wilke, T.: First-order logic with two variables and unary temporal logic. In: 12th IEEE Symposium on Logic in Computer Science, pp. 228–235 (1997)
Segoufin, L., Bojańczyk, M., Straubing, H.: Piecewise testable tree languages (2008)
McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)
Thérien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: 30th ACM Symposium on Theory of Computing, pp. 234–240 (1998)
Wilke, T.: An algebraic characterization of frontier testable tree languages. Theoretical Computer Science 154(1), 85–106 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Place, T. (2008). Characterization of Logics over Ranked Tree Languages. In: Kaminski, M., Martini, S. (eds) Computer Science Logic. CSL 2008. Lecture Notes in Computer Science, vol 5213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87531-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-87531-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87530-7
Online ISBN: 978-3-540-87531-4
eBook Packages: Computer ScienceComputer Science (R0)