Skip to main content
SpringerLink
Log in

EF+EX Forest Algebras

  • Conference paper
  • First Online:
Algebraic Informatics (CAI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9270))

Included in the following conference series:

Abstract

We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz. Our algebraic characterizations yield efficient algorithms for deciding when a given language of forests is definable in this logic. The proofs are based on understanding the wreath product closures of a few small algebras, for which we introduce a general ideal theory for forest algebras. This combines ideas from the work of Bojanczyk and Walukiewicz for the analogous logics on binary trees and from early work of Stiffler on wreath product of finite semigroups.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benedikt, M., Segoufin, L.: Regular tree languages definable in FO and in FO\(_{\text{ mod }}\). ACM Trans. Comput. Log. 11(1) (2009)

    Google Scholar 

  2. Bojanczyk, M., Segoufin, L., Straubing, H.: Piecewise testable tree languages. Logical Methods in Computer Science 8(3) (2012)

    Google Scholar 

  3. Bojanczyk, M., Straubing, H., Walukiewicz, I.: Wreath products of forest algebras with applications to tree logics. Logical Methods in Computer Science 8(3) (2012)

    Google Scholar 

  4. Bojanczyk, M., Walukiewicz, I.: Characterizing EF and EX tree logics. Theor. Comput. Sci. 358(2–3), 255–272 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bojanczyk, M., Walukiewicz, I.: Forest algebras. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol. 2, pp. 107–132. Amsterdam University Press (2008)

    Google Scholar 

  6. Cohen, J., Perrin, D., Pin, J.-E.: On the expressive power of temporal logic. J. Comput. Syst. Sci. 46(3), 271–294 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ésik, Z.: An algebraic characterization of the expressive power of temporal logics on finite trees. In: 1st Int. Conf. Algebraic Informatics. Aristotle Univ. of Thessaloniki, pp. 53–110 (2005)

    Google Scholar 

  8. Krebs, A., Straubing, H.: EF+EX forest algebras. CoRR, abs/1408.0809 (2014)

    Google Scholar 

  9. Stiffler, P.E.: Extension of the fundamental theorem of finite semigroups. Advances in Mathematics 11(2), 159–209 (1973)

    Article  MathSciNet  Google Scholar 

  10. Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston (1994)

    Book  MATH  Google Scholar 

  11. Thérien, D., Wilke, T.: Temporal logic and semidirect products: An effective characterization of the until hierarchy. In: FOCS, pp. 256–263. IEEE Computer Society (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut at Eberhard-Karls, Universität Tübingen, Tübingen, Germany

    Andreas Krebs

  2. Boston College, Chestnut Hill, USA

    Howard Straubing

Authors
  1. Andreas Krebs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Howard Straubing
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Krebs .

Editor information

Editors and Affiliations

  1. Institut für Maschinelle, Universität Stuttgart, Stuttgart, Baden-Württemberg, Germany

    Andreas Maletti

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Krebs, A., Straubing, H. (2015). EF+EX Forest Algebras. In: Maletti, A. (eds) Algebraic Informatics. CAI 2015. Lecture Notes in Computer Science(), vol 9270. Springer, Cham. https://doi.org/10.1007/978-3-319-23021-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23021-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23020-7

  • Online ISBN: 978-3-319-23021-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation