R. Baumgartner, S. Flesca, and G. Gottlob, Visual web information extraction with lixto, The VLDB Journal, pp.119-128, 2001.

J. Carme, A. Lemay, J. Niehren, and A. Terlutte, Learning regular node queries in trees from completely annotated examples. Forthcoming, 2004.

J. Carme, J. Niehren, and M. Tommasi, Querying Unranked Trees with Stepwise Tree Automata, Intenational Conf. on Rewriting Techniques and Applications, 2004.
DOI : 10.1007/978-3-540-25979-4_8

URL : https://hal.archives-ouvertes.fr/inria-00536529

B. Chidlovskii, Wrapping Web Information Providers by Transducer Induction, Proc. ECML, volume 2167 of LNAI, pp.61-73, 2001.
DOI : 10.1007/3-540-44795-4_6

W. W. Cohen, M. Hurst, and L. S. Jensen, A flexible learning system for wrapping tables and lists in HTML documents, Proceedings of the eleventh international conference on World Wide Web , WWW '02, 2003.
DOI : 10.1145/511446.511477

F. Coste and D. Fredouille, Efficient Ambiguity Detection in C-NFA, Grammatical Inference: Algorithms and Applications, LNAI 1891, 2000.
DOI : 10.1007/978-3-540-45257-7_3

C. De and . Higuera, Characteristic sets for polynomial grammatical inference, Machine Learning, pp.125-137, 1997.

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

E. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

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

M. Gruhe and G. Turan, Learnability and definability in trees and similar structures, STACS'02, pp.645-658, 2002.

P. J. Garcia, E. Oncina, and . Vidal, Learning subsequential transducers for pattern recognition and interpretation tasks, IEEE Trans. Patt. Anal. and Mach. Intell, vol.15, pp.448-458, 1993.

C. Kermorvant, C. De, and . Higuera, Learning Languages with Help, 2002.
DOI : 10.1007/3-540-45790-9_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Kosala, M. Bruynooghe, J. V. Den-bussche, and H. Blockeel, Information extraction from web documents based on local unranked tree automaton inference, IJCAI-2003)

N. Kushmerick, Wrapper Induction for Information Extraction, 1997.

K. Lang, Random DFA's can be approximately learned from sparse uniform examples, Proceedings of the fifth annual workshop on Computational learning theory , COLT '92, pp.45-52, 1992.
DOI : 10.1145/130385.130390

K. J. Lang, B. A. Pearlmutter, and R. A. Price, Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm, ICGI 98
DOI : 10.1007/BFb0054059

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. Oncina and P. Garcia, Inferring regular languages in polynomial update time, Pattern Recognition and Image Analysis, pp.49-61, 1992.

J. Oncina and P. García, Inference of recognizable tree sets, 1993.

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

S. Soderland, Learning information extraction rules for semi-structured and free text, Machine Learning, pp.233-272, 1999.

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, 1968.
DOI : 10.1007/BF01691346