E. Filiot, J. Talbot, and S. Tison, Tree Automata with Global Constraints, 12th International Conference in Developments in Language Theory, pp.314-326, 2008.
DOI : 10.1007/978-3-540-85780-8_25
URL : https://hal.archives-ouvertes.fr/inria-00292027

A. Bouajjani and T. Touili, On Computing Reachability Sets of Process Rewrite Systems, Proceedings of the 16th International Conference on Term Rewriting and Applications (RTA 2005), pp.484-499, 2005.
DOI : 10.1007/978-3-540-32033-3_35
URL : https://hal.archives-ouvertes.fr/hal-00161108

K. N. Verma and J. Goubault-larrecq, Alternating two-way AC-tree automata, Information and Computation, vol.205, issue.6, pp.817-869, 2007.
DOI : 10.1016/j.ic.2006.12.006
URL : http://doi.org/10.1016/j.ic.2006.12.006

G. Feuillade, T. Genet, V. Viet-triem, and . Tong, Reachability Analysis over Term Rewriting Systems, Journal of Automated Reasoning, vol.37, issue.1?2, pp.341-383, 2004.
DOI : 10.1007/s10817-004-6246-0
URL : https://hal.archives-ouvertes.fr/inria-00071609

T. Schwentick, Automata for XML???A survey, Journal of Computer and System Sciences, vol.73, issue.3, pp.289-315, 2007.
DOI : 10.1016/j.jcss.2006.10.003

J. Mongy, Transformation de noyaux reconnaissables d'arbres. forêts rateg, Ph.D, 1981.

B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, 9th Symp. on Theoretical Aspects of Computer Science (STACS 1992), ser. LNCS, pp.161-171, 1992.
DOI : 10.1007/3-540-55210-3_181

E. Filiot, J. Talbot, and S. Tison, Satisfiability of a Spatial Logic with Tree Variables, Proceedings of the 21st International Workshop on Computer Science Logic ser. Lecture Notes in Computer Science, pp.130-145, 2007.
DOI : 10.1007/978-3-540-74915-8_13
URL : https://hal.archives-ouvertes.fr/inria-00148462

L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher, The Emptiness Problem for Tree Automata with Global Constraints, 2010 25th Annual IEEE Symposium on Logic in Computer Science
DOI : 10.1109/LICS.2010.28

F. Jacquemard, F. Klay, and C. Vacher, Rigid Tree Automata, Proceedings of the 3rd International Conference on Language and Automata Theory and Applications, pp.446-457, 2009.
DOI : 10.1007/978-3-540-71389-0_13
URL : https://hal.archives-ouvertes.fr/inria-00579001

K. Wong and C. Löding, Unranked Tree Automata with Sibling Equalities and Disequalities, Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), ser. LNCS, pp.875-887, 2007.

C. Löding and K. Wong, On Nondeterministic Unranked Tree Automata with Sibling Constraints, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), ser. Leibniz International Proceedings in Informatics. Schloss Dagstuhl -Leibniz Center for Informatics, 2009.

W. Charatonik, Automata on DAG Representations of Finite Trees Max-Planck-Institut für Informatik, 1999.

S. Anantharaman, P. Narendran, M. Rusinowitch, and V. Cortier, Closure properties and decision problems of dag automata, Information Processing Letters, vol.94, issue.5, pp.231-240, 2005.
DOI : 10.1016/j.ipl.2005.02.004
URL : https://hal.archives-ouvertes.fr/hal-00077495

H. Seidl, T. Schwentick, and A. Muscholl, Numerical document queries, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.155-166, 2003.
DOI : 10.1145/773153.773169

S. , D. Zilio, and D. Lugiez, XML Schema, Tree Logic and Sheaves Automata, Journal Applicable Algebra in Engineering Communication and Computing, vol.17, issue.5, pp.337-377, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00109288

F. Klaedtke and H. Ruess, Parikh Automata and Monadic Second-Order Logics with Linear Cardinality Constraints, 2002.

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

J. H. Gallier, What's so special about Kruskal's theorem and the ordinal ??o? A survey of some results in proof theory, Annals of Pure and Applied Logic, vol.53, issue.3, pp.199-260, 1991.
DOI : 10.1016/0168-0072(91)90022-E

M. Bojanczyk, A. Muscholl, T. Schwentick, and L. Segoufin, Two-Variable Logic on Data Trees and Applications to XML Reasoning, JACM, vol.56, issue.3, 2006.

M. Murata, Hedge Automata: a Formal Model for XML Schemata, Fuji Xerox INformation Systems, Tech. Rep, 1999.

J. W. Thatcher and J. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol.12, issue.1, pp.57-82, 1968.
DOI : 10.1007/BF01691346

W. Charatonik and L. Pacholski, Set constraints with projections are in NEXPTIME, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.642-653, 1994.
DOI : 10.1109/SFCS.1994.365727

R. Gilleron, S. Tison, and M. Tommasi, Some new decidability results on positive and negative set constraints, Proceedings, First International Conference on Constraints in Computational Logics, ser. LNCS, pp.336-351, 1994.
DOI : 10.1007/BFb0016864
URL : https://hal.archives-ouvertes.fr/inria-00538880

L. Segoufin, Automata and Logics for Words and Trees over an Infinite Alphabet, Computer Science Logic, ser. LNCS, 2006.
DOI : 10.1007/11874683_3

M. Jurdzinski and R. Lazic, Alternation-free modal mu-calculus for data trees, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.131-140, 2007.
DOI : 10.1109/LICS.2007.11