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. Miko, A new algorithm for testing if a regular language is locally threshold testable, Information Processing Letters, vol.104, issue.3, pp.91-94, 2007.

B. Miko, Two-way unary temporal logic over trees, Proceedings of the 22th Annual IEEE Symposium on Logic in Computer Science (LICS'07), pp.121-130, 2007.

. Danì, J. Beauquier, and . Pin, Factors of words, Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89)BS73] Janusz A. Brzozowski and Imre Simon. Characterizations of locally testable languages. Discrete Mathematics, pp.63-79243, 1973.

. Miko, L. Boja´nczykboja´nczyk, and . Segoufin, Tree languages defined in firstorder logic with one quantifier alternation, Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP'08), pp.233-245, 2008.

L. Miko-laj-boja´nczykboja´nczyk, H. Segoufin, and . Straubing, Piecewise testable tree languages, Proceedings of the 23th Annual IEEE Symposium on Logic in Computer Science (LICS'08), pp.442-451, 2008.

H. Miko-laj-boja´nczykboja´nczyk, I. Straubing, and . Walukiewicz, Wreath products of forest algebras, with applications to tree logics, Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science (LICS'09), pp.255-263, 2009.

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

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

[. Büchi, Weak Second-Order Arithmetic and Finite Automata, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.9, issue.1-6, pp.66-92, 1960.
DOI : 10.1002/malq.19600060105

V. Diekert and P. Gastin, First-order definable languages, Logic and Automata: History and Perspectives, pp.261-306, 2008.

P. Volker-diekert, M. Gastin, and . Kufleitner, A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS, International Journal of Foundations of Computer Science, vol.19, issue.03, pp.513-548, 2008.
DOI : 10.1142/S0129054108005802

. Ei08a, S. Zoltánzoltán´zoltánésik, and . Iván, Products of tree automata with an application to temporal logic, Fundamenta Informaticae, vol.82, pp.61-78, 2008.

. Ei08b, S. Zoltánzoltán´zoltánésik, and . Iván, Some varieties of finite tree automata related to restricted temporal logics, Fundamenta Informaticae, vol.82, pp.79-103, 2008.

. Zoltánzoltán´zoltánésik, Characterizing CTL-like logics on finite trees, Theoretical Computer Science, vol.356, pp.136-142, 2006.

K. Etessami, M. Y. 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. Marx, First Order Paths in Ordered Trees, Proceedings of the 10th International Conference in Database Theory (ICDT'05), pp.114-128, 2005.
DOI : 10.1007/978-3-540-30570-5_8

R. Mcnaughton, Algebraic decision procedures for local testability, Mathematical Systems Theory, vol.5, issue.1, pp.60-76, 1974.
DOI : 10.1007/BF01761708

[. Pin, Logic, semigroups and automata on words, Proceedings of the 17th Annual EACSL Conference on Computer Science Logic (CSL'08), pp.343-384155, 1996.
DOI : 10.1007/BF02127803

T. Place and L. Segoufin, A decidable characterization of locally testable tree languages, Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), pp.285-296, 2009.

T. Place and L. Segoufin, Deciding definability in FO 2 (<) (or XPath) on trees, Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science (LICS'10), pp.1-1, 2010.

[. Pin and P. Weil, Polynomial closure and unambiguous product, Theory of Computing Systems, 1997.
DOI : 10.1007/bf02679467
URL : https://hal.archives-ouvertes.fr/hal-01248158

M. Paul and S. , On finite monoids having only trivial subgroups, Information and Control, vol.8, 1965.

I. Simon, Piecewise testable events. Automata Theory and Formal Languages, pp.214-222, 1975.
DOI : 10.1007/3-540-07407-4_23

H. Straubing, Finite semigroup varieties of the form V ??? D, Journal of Pure and Applied Algebra, vol.36, issue.1, pp.53-94, 1985.
DOI : 10.1016/0022-4049(85)90062-3

B. Tilson, Categories as algebra: An essential ingredient in the theory of monoids, Journal of Pure and Applied Algebra, vol.48, issue.1-2, pp.83-198, 1987.
DOI : 10.1016/0022-4049(87)90108-3

P. Tesson and D. Thérien, DIAMONDS ARE FOREVER: THE VARIETY DA, Semigroups, Algorithms, Automata and Languages, pp.475-500, 2002.
DOI : 10.1142/9789812776884_0021

W. James, J. B. Thatcher, and . Wright, Generalized finite automata with an application to a decision problem of second-order logic, Mathematical System Theory, 1968.

D. Thérien and A. Weiss, Graph congruences and wreath products, Journal of Pure and Applied Algebra, vol.36, pp.205-215, 1985.
DOI : 10.1016/0022-4049(85)90071-4

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