P. [. Anantharaman, M. Narendran, and . Rusinowitch, 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

. Bcg-+-10-]-l, C. Barguñó, G. Creus, F. Godoy, C. Jacquemard et al., The emptiness problem for tree automata with global constraints, Logic in Computer Science (LICS), pp.263-272, 2010.

M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, T. Baader et al., Two-variable logic on data trees and applications to XML reasoning A preliminary version was presented at PODS 06 Term Rewriting and All That, JACM, vol.56, issue.3, 1998.

L. Bargu?n´obargu?, C. Bargu?n´o, G. Creus, F. Godoy, A. C. Jacquemard et al., Equality and Disequality Constraints on Direct Subterms in Tree Automata, 9th Symp. on Theoretical Aspects of Computer Science, STACS, pp.161-171, 1992.

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

H. Comon and V. Cortier, Tree automata with one memory set constraints and cryptographic protocols, Theoretical Computer Science, vol.331, issue.1, pp.143-214, 2005.
DOI : 10.1016/j.tcs.2004.09.036
URL : https://hal.archives-ouvertes.fr/inria-00000553

W. Charatonik, Automata on DAG representations of finite trees, 1999.

H. Comon, M. Haberstrau, J. P. Jouannaudcp94-]-w, L. Charatonik, and . Pacholski, Syntacticness, cycle-syntacticness, and shallow theories Information and Computation Set constraints with projections are in NEXPTIME, Proceedings of the 35 th Symp. Foundations of Computer ScienceDL06] S. Dal and D. Lugiez. XML schema, tree logic and sheaves automata. Journal Applicable Algebra in Engineering, Communication and Computing, pp.154-191, 1994.

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

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, pp.130-145, 2007.
DOI : 10.1007/978-3-540-74915-8_13
URL : https://hal.archives-ouvertes.fr/inria-00148462

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

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

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, pp.336-351, 1994.
DOI : 10.1007/BFb0016864
URL : https://hal.archives-ouvertes.fr/inria-00538880

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

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

F. Klaedtke and H. Ruess, On nondeterministic unranked tree automata with sibling constraints Hedge automata: a formal model for XML schemata, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science Leibniz International Proceedings in Informatics. Schloss Dagstuhl -Leibniz Center for Informatics Logic in Computer Science (LICS), pp.473-482, 1981.

J. Niehren, L. Planque, J. Talbot, and S. Tison, N-Ary Queries by Tree Automata, Proceedings of the 10th International Symposium on Database Programming Languages Muscholl. Numerical document queries Principle of Databases Systems (PODS) Proceedings, Ninth Annual IEEE Symposium on Logic in Computer ScienceTre00] R. Treinen. Predicate logic and tree automata with tests Proc. of the 3rd Int. Conf. on Foundations of Software Science and Computation Structures, pp.217-231289, 1994.
DOI : 10.1007/11601524_14
URL : https://hal.archives-ouvertes.fr/inria-00536522

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

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), pp.875-887, 2007.