J. Carme, J. Niehren, and M. Tommasi, Querying Unranked Trees with Stepwise Tree Automata, International Conference on Rewriting Techniques and Applications, pp.105-118, 2004.
DOI : 10.1007/978-3-540-25979-4_8
URL : https://hal.archives-ouvertes.fr/inria-00536529

T. Colcombet, Rewriting in the partial algebra of typed terms modulo AC, Electronic Notes in Theoretical Computer Science, 2002.
DOI : 10.1016/S1571-0661(04)80532-2

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle, The monadic second order logic of graphs VI: on several representations of graphs by relational structures, Discrete Applied Mathematics, vol.54, issue.2-3, pp.117-149, 1994.
DOI : 10.1016/0166-218X(94)90019-1

B. Courcelle, Basic notions of universal algebra for language theory and graph grammars, Theoretical Computer Science, vol.163, issue.1-2, pp.1-54, 1996.
DOI : 10.1016/0304-3975(95)00145-X

S. Dal-zilio, D. Lugiez, and . Schema, Tree Logic and Sheaves Automata, Rewriting Techniques and Applications, 14th International Conference, pp.246-263, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00109288

S. Dal-zilio, D. Lugiez, and C. Meyssonnier, A logic you can count on, 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071562

S. Gaubert and A. Giua, Petri Net Languages and Infinite Subsets of Nm, Journal of Computer and System Sciences, vol.59, issue.3, pp.373-391, 1999.
DOI : 10.1006/jcss.1999.1634

G. Guaiana, A. Restivo, and S. Salemi, On aperiodic trace languages, STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer, pp.76-88, 1991.
DOI : 10.1007/BFb0020789

F. Klaedtke and H. Rueß, Monadic Second-Order Logics with Cardinalities, 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, 2003.
DOI : 10.1007/3-540-45061-0_54

J. Mezei and J. B. Wright, Algebraic automata and context-free sets, Information and Control, vol.11, issue.1-2, pp.3-29, 1967.
DOI : 10.1016/S0019-9958(67)90353-1

F. Neven and T. Schwentick, Query automata over finite trees, Theoretical Computer Science, vol.275, issue.1-2, pp.633-674, 2002.
DOI : 10.1016/S0304-3975(01)00301-2

J. Niehren and A. Podelski, Feature automata and recognizable sets of feature trees, Theory and Practice of Software Development, International Joint Conference CAAP, pp.356-375, 1993.
DOI : 10.1007/3-540-56610-4_76
URL : https://hal.archives-ouvertes.fr/inria-00536823

H. Ohsaki, Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories, Proceedings of 15th International Conference of the European Association for Computer Science Logic -CSL 2001, pp.539-553, 2001.
DOI : 10.1007/3-540-44802-0_38

H. Ohsaki and T. Takai, Decidability and Closure Properties of Equational Tree Languages, Proceedings of 13th International Conference on Rewriting Techniques and Applications, pp.114-128, 2002.
DOI : 10.1007/3-540-45610-4_9

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

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

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

K. N. Verma, Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties, Proceedings of 14th International Conference on Rewriting Techniques and Applications, pp.180-197, 2003.
DOI : 10.1007/3-540-44881-0_14