G. J. Bex, F. Neven, T. Schwentick, and K. Tuyls, Inference of Concise DTDs from XML data, VLDB, pp.115-126, 2006.

A. Brüggemann-klein, Regular expressions into finite automata, Theoretical Computer Science, vol.120, issue.2, pp.197-213, 1993.
DOI : 10.1016/0304-3975(93)90287-4

A. Brüggemann-klein and D. Wood, One-Unambiguous Regular Languages, Information and Computation, vol.142, issue.2, pp.182-206, 1998.
DOI : 10.1006/inco.1997.2695

J. Carme, R. Gilleron, A. Lemay, and J. Niehren, Interactive learning of node selecting tree transducer, Machine Learning, pp.33-67, 2007.
DOI : 10.1007/s10994-006-9613-8

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

J. Champavère, R. Gilleron, A. Lemay, and J. Niehren, Efficient Inclusion Checking for Deterministic Tree Automata and DTDs, LATA, 2008.
DOI : 10.1007/978-3-540-88282-4_18

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, pp.232-241, 2002.
DOI : 10.1145/511446.511477

F. Coste, D. Fredouille, C. Kermovant, C. De, and L. Higuera, Introducing Domain and Typing Bias in Automata Inference, ICGI, pp.115-126, 2004.
DOI : 10.1007/978-3-540-30195-0_11

E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov, Complexity and expressive power of logic programming, ACM Computing Surveys, vol.33, issue.3, pp.374-425, 2001.
DOI : 10.1145/502807.502810

A. Finn and N. Kushmerick, Multi-level Boundary Classification for Information Extraction, ECML, pp.111-122, 2004.
DOI : 10.1007/978-3-540-30115-8_13

R. Gilleron, P. Marty, M. Tommasi, and F. Torre, Interactive Tuples Extraction from Semi-Structured Data, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06), pp.997-1004, 2006.
DOI : 10.1109/WI.2006.102
URL : https://hal.archives-ouvertes.fr/inria-00581253

R. Kosala and K. U. Leuven, Information Extraction by Tree Automata Inference, 2003.

T. Trausti, A. Kristjansson, P. Culotta, A. Viola, and . Mccallum, Interactive Information Extraction with Constrained Conditional Random Fields, AAAI, 2004.

A. Lemay, J. Niehren, and R. Gilleron, Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples, ICGI, pp.253-267, 2006.
DOI : 10.1007/11872436_21
URL : https://hal.archives-ouvertes.fr/inria-00088077

K. Lerman, S. Minton, and C. Knoblock, Wrapper Maintenance: a Machine Learning Approach, Journal of Artificial Intelligence Research, vol.18, pp.149-181, 2003.

J. Oncina and P. Garcia, Inferring Regular Languages in Polynomial Update Time, Pattern Recognition and Image Analysis, pp.49-61, 1992.

S. Raeymaekers and K. U. Leuven, Information Extraction from Web Pages Based on Tree Automata Induction, 2008.

S. Raeymaekers, M. Bruynooghe, and J. Van-den-bussche, Learning (k,l)-Contextual Tree Languages for Information Extraction, ECML, pp.305-316, 2005.
DOI : 10.1007/11564096_31