G. J. Bex, W. Gelade, F. Neven, and S. Vansummeren, Learning deterministic regular expressions for the inference of schemas from XML data, ACM Transactions on the Web, vol.4, issue.4

G. J. Bex, F. Neven, T. Schwentick, and S. Vansummeren, Inference of concise regular expressions and DTDs, ACM Transactions on Database Systems, vol.35, issue.2, p.5
DOI : 10.1145/1735886.1735890

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

C. Choffrut, Minimizing subsequential transducers: a survey, Theoretical Computer Science, vol.292, issue.1, pp.1-3, 2003.
DOI : 10.1016/S0304-3975(01)00219-5

H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard et al., Tree automata techniques and applications. Available online since, 1997.

C. De and . Higuera, A bibliographical study of grammatical inference, Pattern Recognition
URL : https://hal.archives-ouvertes.fr/ujm-00376590

J. Engelfriet, S. Maneth, and H. Seidl, Deciding equivalence of top???down XML transformations in polynomial time, Journal of Computer and System Sciences, vol.75, issue.5, pp.271-286, 2009.
DOI : 10.1016/j.jcss.2009.01.001

E. Filiot, J. F. Raskin, P. A. Reynier, F. Servais, and J. M. Talbot, Properties of Visibly Pushdown Transducers, MFCS 2010, pp.3-5
DOI : 10.1007/978-3-642-15155-2_32
URL : https://hal.archives-ouvertes.fr/inria-00492241

S. Friese, H. Seidl, and S. Maneth, Minimization of Deterministic Bottom-Up Tree Transducers, DLT 2010
DOI : 10.1007/978-3-642-14455-4_18

E. M. Gold, Complexity of automaton identification from given data, Information and Control, vol.37, issue.3
DOI : 10.1016/S0019-9958(78)90562-4

T. V. Griffiths, The unsolvability of the equivalence problem for Lambda-Free nondeterministic generalized machines, Journal of the ACM, vol.1, issue.5 3

G. Laurence, A. Lemay, J. Niehren, S. Staworko, and M. Tommasi, Normalization of Sequential Top-Down Tree-to-Word Transducers, LATA 2011, pp.3-5
DOI : 10.1007/978-3-642-21254-3_28
URL : https://hal.archives-ouvertes.fr/inria-00566291

A. Lemay, S. Maneth, and J. Niehren, A learning algorithm for top-down XML transformations, Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, PODS '10, pp.285-296, 2010.
DOI : 10.1145/1807085.1807122
URL : https://hal.archives-ouvertes.fr/inria-00460489

W. Martens, F. Neven, and M. Gyssens, Typechecking top-down XML transformations: Fixed input or output schemas, Information and Computation, vol.206, issue.7, pp.0-6
DOI : 10.1016/j.ic.2008.01.002

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

J. Oncina and P. Gracia, IDENTIFYING REGULAR LANGUAGES IN POLYNOMIAL TIME, Advances in Structural and Syntactic Pattern Recognition
DOI : 10.1142/9789812797919_0007

C. Papadimitriou, Computational complexity.A d d i s o n -W e s l e, pp.9-9

J. Raskin and F. Servais, Visibly Pushdown Transducers, Automata, Languages and Programming, pp.3-8, 2008.
DOI : 10.1007/978-3-540-70583-3_32
URL : https://hal.archives-ouvertes.fr/inria-00492241

S. Staworko, G. Laurence, A. Lemay, and J. Niehren, Equivalence of nested word to word transducers, FCT 2009, pp.3-4
URL : https://hal.archives-ouvertes.fr/inria-00423961

S. Staworko and P. Wieczorek, Learning XML twig queries. CoRR,a b s, 2011.