EF+EX Forest Algebras

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