Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-26T16:04:33.212Z Has data issue: false hasContentIssue false
  • English
  • Français

New applications of the wreath product of forest algebras∗

Published online by Cambridge University Press:  30 July 2013

Howard Straubing
Howard Straubing*
Affiliation:
Computer Science Department, Boston College, Chestnut Hill, 02467 Massachusetts, USA.. [email protected]
Get access

Abstract

We give several new applications of the wreath product of forest algebras to the study oflogics on trees. These include new simplified proofs of necessary conditions fordefinability in CTL and first-order logic with the ancestor relation; asequence of identities satisfied by all forest languages definable inPDL; and new examples of languages outside CTL, alongwith an application to the question of what properties are definable in bothCTL and LTL.

Keywords

Tree automatatemporal logicsforest algebras
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 47 , Issue 3 , July 2013 , pp. 261 - 291
Copyright
© EDP Sciences 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Benedikt, M. and Segoufin, L., Regular tree languages definable in fo and in fomod. ACM Trans. Comput. Logic 11 (2009) 1–4. Google Scholar
M. Bojanczyk, Algebra for trees, in AutoMathA Handbook, edited by J.-E. Pin (2012). Preprint.
M. Bojanczyk and I. Walukiewicz, Forest algebras, in Logic and Automata: History and Perspectives, edited by E. Graedel, J. Flum and T. Wilke. Amsterdam University Press (2008).
M. Bojańczyk, Decidable Properties of Tree Languages. Ph.D. thesis, University of Warsaw (2004).
M. Bojanczyk, The common fragment of actl and ltl. In FoSSaCS, vol. 4962 of Lect. Notes Comput Sci., edited by R.M. Amadio (2008) 172–185.
M. Bojanczyk, L. Segoufin and H. Straubing, Piecewise testable tree languages. To appear in Logical Methods Comput. Sci. (2012).
M. Bojanczyk, H. Straubing and I. Walukiewicz, Wreath products of forest algebras, with applications to tree logics. To appear in Logical Methods Comput. Sci. (2012).
S. Eilenberg, Automata, Languages, and Machines, vol. B. Pure and Applied Mathematics. New York, Academic Press (1976).
E. Allen Emerson, Temporal and modal logic, in Handbook Of Theoretical Computer Science. Elsevier (1995) 995–1072.
L. Libkin, Elements Of Finite Model Theory. Texts in Theoretical Computer Science. Springer (2004).
M. Maidl, The common fragment of ctl and ltl. In FOCS. IEEE Computer Society (2000) 643–652.
F. Moller and A. M. Rabinovich, On the expressive power of ctl. In LICS. IEEE Computer Society (1999) 360–368.
J.E. Pin, Varieties of formal languages. North Oxford Academic (1986).
J.-E. Pin, Syntactic semigroups, vol. 1 in Handbook of Formal Languages. Springer (1997).
Potthoff, A., First-order logic on finite trees. Lect. Notes Comput. Sci. 915 (1995) 125–139. Google Scholar
Schützenberger, M., Sur le produit de concatenation non ambigu. Semigroup Forum 13 (1976) 47–75. Doi: 10.1007/BF02194921. Google Scholar
Shamir, S., Kupferman, O. and Shamir, E., Branching-depth hierarchies. Electr. Notes Theor. Comput. Sci. 39 (2000) 65–78. Google Scholar