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

M. Dauchet, A. C. Caron, and J. L. Coquidé, Automata for Reduction Properties Solving, Journal of Symbolic Computation, vol.20, issue.2, pp.215-233, 1995.
DOI : 10.1006/jsco.1995.1048
URL : http://doi.org/10.1006/jsco.1995.1048

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

E. Filiot, J. M. Talbot, and S. Tison, Tree automata with global constraints, 12th International Conference in Developments in Language Theory, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00292027

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

T. Genet and F. Klay, Rewriting for Cryptographic Protocol Verification, 17th Int. Conf. on Automated Deduction, 2000.
DOI : 10.1007/10721959_21
URL : https://hal.archives-ouvertes.fr/inria-00072731

M. Abadi and C. Fournet, Mobile values, new names, and secure communication, 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.104-115, 2001.
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924

F. Jacquemard, M. Rusinowitch, and L. Vigneron, Tree automata with equality constraints modulo equational theories, The Journal of Logic and Algebraic Programming, vol.75, issue.2, pp.182-208, 2008.
DOI : 10.1016/j.jlap.2007.10.006
URL : https://hal.archives-ouvertes.fr/inria-00579011

F. Jacquemard, F. Klay, and C. Vacher, Rigid Tree Automata, 2008.
DOI : 10.1007/978-3-540-71389-0_13
URL : https://hal.archives-ouvertes.fr/inria-00579001

E. Filiot, J. M. Talbot, and S. Tison, Satisfiability of a Spatial Logic with Tree Variables, 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

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

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

H. Seidl, Haskell overloading is DEXPTIME-complete, Information Processing Letters, vol.52, issue.2, pp.57-60, 1994.
DOI : 10.1016/0020-0190(94)00130-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.8086

R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757

J. Chabin and P. Réty, Visibly Pushdown Languages and Term Rewriting, 6th International Symposium on Frontiers of Combining Systems (FroCos), pp.252-266, 2007.
DOI : 10.1007/978-3-540-74621-8_17
URL : https://hal.archives-ouvertes.fr/inria-00462510

H. Comon-lundh, F. Jacquemard, and N. Perrin, Tree Automata with Memory, Visibility and Structural Constraints, 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS, pp.168-182, 2007.
DOI : 10.1007/978-3-540-71389-0_13
URL : https://hal.archives-ouvertes.fr/inria-00579009