A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna et al., The AVISS Security Protocol Analysis Tool, Proc. of 14th CAV, pp.349-353, 2002.
DOI : 10.1007/3-540-45657-0_27
URL : https://hal.archives-ouvertes.fr/inria-00100915

I. Boneva and J. Talbot, Automata and Logics for Unranked and Unordered Trees, Proc. of 16th RTA, pp.500-515, 2005.
DOI : 10.1007/978-3-540-32033-3_36
URL : https://hal.archives-ouvertes.fr/inria-00536694

A. Bouhoula, J. P. Jouannaud, and J. Meseguer, Specification and proof in membership equational logic, Theoretical Computer Science, vol.236, issue.1-2, pp.35-132, 2000.
DOI : 10.1016/S0304-3975(99)00206-6
URL : https://hal.archives-ouvertes.fr/inria-00099079

T. Colcombet, Rewriting in the partial algebra of typed terms modulo AC, Proc. of 4th INFINITY, Brno (Czech Republic), 2002.
DOI : 10.1016/S1571-0661(04)80532-2

N. Dershowitz and R. Treinen, Problem #101. The RTA List of Open Problems

P. Devienne, J. Talbot, and S. Tison, Set-Based Analysis for Logic Programming and Tree Automata, Proc. of 4th SAS, pp.127-140, 1997.

J. Esparza, Decidability and complexity of Petri net problems ??? An introduction, Petri Nets, Dagstuhl (Germany), volume 1491 of LNCS, pp.374-428, 1996.
DOI : 10.1007/3-540-65306-6_20

J. Esparza, Decidability of model checking for infinite-state concurrent systems, Acta Informatica, vol.34, issue.2, pp.85-107, 1997.
DOI : 10.1007/s002360050074

J. Esparza, Grammars as Processes, Formal and Natural Computing ? Essays Dedicated to Grzegorz Rozenberg, pp.277-297, 2002.
DOI : 10.1007/3-540-45711-9_16

J. P. Gallagher and G. Puebla, Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs, Proc. of 4th PADL, pp.243-261, 2002.
DOI : 10.1007/3-540-45587-6_16

T. Genet and F. Klay, Rewriting for Cryptographic Protocol Verification, Proc. of 17th CADE, pp.271-290, 2000.
DOI : 10.1007/10721959_21
URL : https://hal.archives-ouvertes.fr/inria-00072731

S. Ginsburg, The Mathematical Theory of Context-Free Languages, 1966.

J. Goubault-larrecq and K. N. Verma, Alternating Two-way AC-Tree Automata, 2002.

D. Hauschildt, Semilinearity of the Reachability Set is Decidable for Petri Nets, 1990.

J. Hendrix, H. Ohsaki, and J. Meseguer, Sufficient Completeness Checking with Propositional Tree Automata, 2005.

H. Hosoya, J. Vouillon, and B. C. Pierce, Regular Expression Types for XML, Proc. of 5th ICFP) of SIGPLAN Notices, pp.11-22, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00009271

N. D. Jones, L. H. Landweber, and Y. E. Lien, Complexity of some problems in Petri nets, Theoretical Computer Science, vol.4, issue.3, pp.277-299, 1977.
DOI : 10.1016/0304-3975(77)90014-7

M. Kudlek and V. Mitrana, Normal Forms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages, Multiset Processing, pp.135-146, 2001.
DOI : 10.1007/3-540-45523-X_8

S. Y. Kuroda, Classes of languages and linear-bounded automata, Information and Control, vol.7, issue.2, pp.207-223, 1964.
DOI : 10.1016/S0019-9958(64)90120-2

D. Lugiez, Counting and Equality Corstraints for Multitree Automata, Proc. of 6th FOS- SACS, pp.328-342, 2003.

Y. Matiyasevich, Enumerable Sets are Diophantine, Russian). Improved and English translation in Soviet Mathematics Doklady, pp.279-282354, 1970.

H. Ohsaki, Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories, Proc. of 15th CSL, pp.539-553, 2001.
DOI : 10.1007/3-540-44802-0_38

H. Ohsaki, H. Seki, and T. Takai, Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism, Proc. of 14th RTA, pp.483-498, 2003.
DOI : 10.1007/3-540-44881-0_34

H. Ohsaki and T. Takai, Decidability and Closure Properties of Equational Tree Languages, Proc. of 13th RTA, pp.114-128, 2002.
DOI : 10.1007/3-540-45610-4_9

H. Ohsaki and T. Takai, ACTAS : A System Design for Associative and Commutative Tree Automata Theory, Proc. of 5th RULE, pp.97-111, 2005.
DOI : 10.1016/j.entcs.2004.07.017

R. J. Parikh, On Context-Free Languages, Journal of the ACM, vol.13, issue.4, pp.570-581, 1966.
DOI : 10.1145/321356.321364

W. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X
URL : http://doi.org/10.1016/s0022-0000(70)80006-x

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

K. N. Verma, On Closure under Complementation of Equational Tree Automata for Theories Extending AC, Proc. of 10th LPAR, pp.183-197, 2003.
DOI : 10.1007/978-3-540-39813-4_12

K. N. Verma, Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties, Proc. of 14th RTA, pp.180-197, 2003.
DOI : 10.1007/3-540-44881-0_14