R. Baumgartner, S. Flesca, and G. Gottlob, Visual web information extraction with lixto, 28th International Conference on Very Large Data Bases, pp.119-128, 2001.

A. Berlea and H. Seidl, Binary queries for document trees, Nordic Journal of Computing, vol.11, issue.1, pp.41-71, 2004.

R. Bloem and J. Engelfriet, A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars, Journal of Computer and System Sciences, vol.61, issue.1, pp.1-50, 2000.
DOI : 10.1006/jcss.1999.1684

A. Bruggemann-klein, D. Wood, and M. Murata, Regular tree and regular hedge languages over unranked alphabets: Version 1, 2001.

J. Carme, A. Lemay, and J. Niehren, Learning Node Selecting Tree Transducer from Completely Annotated Examples, 7th International Colloquium on Grammatical Inference, pp.91-102, 2004.
DOI : 10.1007/978-3-540-30195-0_9
URL : https://hal.archives-ouvertes.fr/inria-00536528

J. Carme, J. Niehren, and M. Tommasi, Querying Unranked Trees with Stepwise Tree Automata, 19th 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

G. Castagna, Patterns and types for querying XML, 10th International Symposium on Database Programming Languages, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00152661

J. Chomicki, D. Q. Goldin, and G. M. Kuper, Variable independence and aggregation closure, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '96, pp.40-48, 1996.
DOI : 10.1145/237661.237673

M. Frick, M. Grohe, and C. Koch, Query evaluation on compressed trees, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.188-197, 2003.
DOI : 10.1109/LICS.2003.1210058

G. Gottlob and C. Koch, Monadic queries over tree-structured data, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.189-202, 2002.
DOI : 10.1109/LICS.2002.1029828

G. Gottlob, C. Koch, R. Baumgartner, M. Herzog, and S. Flesca, The Lixto data extraction project -back and forth between theory and practice, ACM Symposium on Principles of Database Systems, 2004.

H. Hosoya and B. Pierce, Regular expression pattern matching for xml, Journal of Functional Programming, vol.6, issue.13, pp.961-1004, 2003.

L. Libkin, Variable independence for first-order definable constraints, ACM Transactions on Computational Logic, vol.4, issue.4, pp.431-451, 2003.
DOI : 10.1145/937555.937557

S. Maneth, A. Berlea, T. Perst, and H. Seidl, XML type checking with macro tree transducers, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.283-294, 2005.
DOI : 10.1145/1065167.1065203

W. Martens and J. Niehren, Minimizing Tree Automata for Unranked Trees, 10th International Symposium on Database Programming Languages, 2005.
DOI : 10.1007/11601524_15
URL : https://hal.archives-ouvertes.fr/inria-00536521

M. Marx, Conditional XPath, the first order complete XPath dialect, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '04, pp.13-22, 2004.
DOI : 10.1145/1055558.1055562

F. Neven and J. V. Bussche, Expressiveness of structured document query languages based on attribute grammars, Journal of the ACM, vol.49, issue.1, pp.56-100, 2002.
DOI : 10.1145/505241.505245

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

H. Seidl, On the finite degree of ambiguity of finite tree automata, Acta Informatica, vol.26, issue.6, pp.527-542, 1989.

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