R. Baumgartner, S. Flesca, and G. Gottlob, Visual web information extraction with Lixto, The Very Large Data Bases Journal, pp.119-128, 2001.

A. Berlea and H. Seidl, Binary queries, Proceedings of Extreme Markup Languages, 2002.

A. Brüggemann-klein, M. Murata, and D. Wood, Regular tree and regular hedge languages over unranked alphabets, 2001.

H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez et al., Tree automata techniques and applications. Online book, 450 pages. Available at, 1997.

B. Courcelle, On Recognizable Sets and Tree Automata, Resolution of Equations in Algebraic Structures, Algebraic Techniques, pp.93-126, 1989.
DOI : 10.1016/B978-0-12-046370-1.50009-7

M. Frick, M. Grohe, and C. Koch, Query evaluation on compressed trees, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003.
DOI : 10.1109/LICS.2003.1210058
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.5196

G. Gottlob and C. Koch, Monadic datalog and the expressive power of languages for web information extraction, Proceedings of the ACM Symposium on Principle of Databases Systems, pp.17-28, 2002.

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

G. Gottlob, C. Koch, and R. Pichler, The complexity of XPath query evaluation, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.179-190, 2003.
DOI : 10.1145/773153.773171

G. Gottlob, C. Koch, and R. Pichler, XPath processing in a nutshell, ACM SIGMOD Record, vol.32, issue.2, pp.21-27, 2003.
DOI : 10.1145/776985.776988

C. Koch, Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage, Proceedings of the International Conference on Very Large Data Bases, 2003.
DOI : 10.1016/B978-012722442-8/50030-6

A. Neumann and H. Seidl, Locating Matches of Tree Patterns in Forests, Foundations of Software Technology and Theoretical Computer Science, pp.134-145, 1998.
DOI : 10.1007/978-3-540-49382-2_12

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, Proceedings of TAPSOFT'93, pp.356-375, 1993.
DOI : 10.1007/3-540-56610-4_76
URL : https://hal.archives-ouvertes.fr/inria-00536823

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, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, Journal of Computer and System Sciences, vol.1, issue.4, pp.317-322, 1967.
DOI : 10.1016/S0022-0000(67)80022-9

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

S. D. Zilio and D. Lugiez, XML schema, tree logic and sheaves automata, Proceedings of RTA, pp.246-263, 2003.
DOI : 10.1007/s00200-006-0016-7
URL : https://hal.archives-ouvertes.fr/hal-00109288