A. Aiken, D. Kozen, and E. L. Wimmers, Decidability of Systems of Set Constraints with Negative Constraints, Information and Computation, vol.122, issue.1, pp.30-44, 1995.
DOI : 10.1006/inco.1995.1139

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

B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, STACS'92, pp.161-171
DOI : 10.1007/3-540-55210-3_181

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

W. Charatonik and L. Pacholski, Set constraints with projections are in NEXPTIME, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994.
DOI : 10.1109/SFCS.1994.365727
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.7552

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

H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard et al., Tree automata techniques and applications, 2007.

H. Comon and C. Delor, Equational formulae with membership constraints . Information and Computation, pp.167-216, 1994.
DOI : 10.1006/inco.1994.1056
URL : http://doi.org/10.1006/inco.1994.1056

M. Dauchet, A. Caron, and J. Coquidé, Reduction properties and automata with constraints, JSC, vol.20, pp.215-233, 1995.

E. Filiot, J. Talbot, and S. Tison, Satisfiability of a Spatial Logic with Tree Variables, CSL'07, pp.130-145
DOI : 10.1007/978-3-540-74915-8_13
URL : https://hal.archives-ouvertes.fr/inria-00148462

E. Filiot, Logics for n-ary queries in trees, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00330524

R. Gilleron, S. Tison, and M. Tommasi, Some new decidability results on positive and negative set constraints, Proceedings of the 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, M. Rusinowitch, and L. Vigneron, Tree automata with equality constraints modulo equational theories, Research Report, 2006.
DOI : 10.1007/11814771_45
URL : https://hal.archives-ouvertes.fr/inria-00579011

W. Karianto and C. Löding, Unranked Tree Automata with Sibling Equalities and Disequalities, Research Report, RWTH Aachen, 2006.
DOI : 10.1007/978-3-540-73420-8_75
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.5167

C. Kirchner, R. Kopetz, and P. Moreau, Anti-pattern Matching, ESOP'07, 2007.
DOI : 10.1007/978-3-540-71316-6_9
URL : https://hal.archives-ouvertes.fr/inria-00337722