J. Almeida, A SYNTACTICAL PROOF OF LOCALITY OF DA, International Journal of Algebra and Computation, vol.06, issue.02, pp.165-177, 1996.
DOI : 10.1142/S021819679600009X

B. Mikoo, Two-way unary temporal logic over trees, Logical Methods in Computer Science, vol.5, issue.3, 2009.

B. Mikoo and L. Segoufin, Tree languages defined in first-order logic with one quantifier alternation, Logical Methods in Computer Science, vol.6, issue.4, 2010.

L. Mikoo-laj-boja´nczykboja´nczyk, H. Segoufin, and . Straubing, Piecewise testable tree languages, Logical Methods in Computer Science, vol.8, issue.3, p.2012

H. Mikoo-laj-boja´nczykboja´nczyk, I. Straubing, and . Walukiewicz, Wreath products of forest algebras, with applications to tree logics, Logical Methods in Computer Science, vol.8, issue.3, p.2012

B. Mikoo and I. Walukiewicz, Characterizing EF and EX tree logics, Theoretical Computer Science, vol.358, 2006.

B. Mikoo and I. Walukiewicz, Forest algebras, Automata and Logic: History and Perspectives, pp.107-132, 2007.

K. Etessami, M. Vardi, and T. Wilke, First-Order Logic with Two Variables and Unary Temporal Logic, Information and Computation, vol.179, issue.2, pp.279-295, 2002.
DOI : 10.1006/inco.2001.2953

P. Zoltánzoltán´zoltánésik and . Weil, Algebraic characterization of regular tree languages, Theoretical Computer Science, vol.340, pp.291-321, 2005.

M. Kufleitner, Logical Fragments for Mazurkiewicz Traces: Expressive Power and Algebraic Characterizations, 2006.

M. Marx, First order paths in ordered trees Characterization of logics over ranked tree languages, Proceedings of the 10th International Conference in Database Theory (ICDT'05) Proceedings of the 17th Annual EACSL Conference on Computer Science Logic (CSL'08), pp.114-128, 2005.

A. Potthoff, Modulo-counting quantifiers over finite trees, Modulo-counting quantifiers over finite trees Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS'10)PS11] Thomas Place and Luc Segoufin. A decidable characterization of locally testable tree languages. Logical Methods in Computer Science, pp.97-112, 1994.
DOI : 10.1016/0304-3975(94)90270-4

URL : http://doi.org/10.1016/0304-3975(94)90270-4

H. Straubing, Finite Automata, Formal Logic and Circuit Complexity, 1994.
DOI : 10.1007/978-1-4612-0289-9

D. Thérien and T. Wilke, Over words, two variables are as powerful as one quantifier alternation, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.234-240, 1998.
DOI : 10.1145/276698.276749

T. Wilke, An algebraic characterization of frontier testable tree languages, Theoretical Computer Science, vol.154, issue.1, pp.85-106, 1996.
DOI : 10.1016/0304-3975(95)00131-X