S. Amer-yahia, S. Cho, L. V. Lakshmanan, and D. Srivastava, Tree pattern query minimization, The VLDB Journal The International Journal on Very Large Data Bases, vol.11, issue.4, pp.315-331, 2002.
DOI : 10.1007/s00778-002-0076-7

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

D. Angluin, Finding patterns common to a set of strings, ACM Symposium on Theory of Computing (STOC), pp.130-141, 1979.
DOI : 10.1016/0022-0000(80)90041-0

D. Angluin, Inductive inference of formal languages from positive data, Information and Control, vol.45, issue.2, pp.117-135, 1980.
DOI : 10.1016/S0019-9958(80)90285-5

D. Angluin, Inference of Reversible Languages, Journal of the ACM, vol.29, issue.3, pp.741-765, 1982.
DOI : 10.1145/322326.322334

D. Angluin, Learning regular sets from queries and counterexamples. Information and Computation, pp.87-106, 1987.
DOI : 10.1016/0890-5401(87)90052-6

URL : http://doi.org/10.1016/0890-5401(87)90052-6

M. Arenas and L. Libkin, XML data exchange: Consistency and query answering, ACM Symposium on Principles of Database Systems (PODS), pp.13-24, 2005.

M. Benedikt, W. Fan, and F. Geerts, XPath satisfiability in the presence of DTDs, ACM Symposium on Principles of Database Systems (PODS), 2005.

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, 2010.

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.2010
DOI : 10.1145/1735886.1735890

J. Carme, M. Ceresna, and M. Goebel, Query-Based Learning of XPath Expressions, International Colloquium on Grammatical Inference (ICGI), pp.342-343, 2006.
DOI : 10.1007/11872436_29

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. Champavère, R. Gilleron, A. Lemay, and J. Niehren, Schema-Guided Induction of Monadic Queries, International Colloquium on Grammatical Inference (ICGI), pp.15-28, 2008.
DOI : 10.1007/978-3-540-88009-7_2

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

C. De and L. Higuera, A bibliographical study of grammatical inference, Pattern Recogn, vol.38, pp.1332-1348, 2005.
URL : https://hal.archives-ouvertes.fr/ujm-00376590

A. Deutsch and A. Tannen, Containment and integrity constraints for XPath, In KRDB, 2001.

A. Ehrenfeucht and P. Zeiger, Complexity measures for regular expressions, Journal of Computer and System Sciences, vol.12, issue.2, pp.134-146, 1976.
DOI : 10.1016/S0022-0000(76)80034-7

URL : http://doi.org/10.1016/s0022-0000(76)80034-7

H. Fernau, Extracting Minimum Length Document Type Definitions Is NP-Hard, International Colloquium on Grammatical Inference (ICGI), pp.277-278, 2004.
DOI : 10.1007/978-3-540-30195-0_26

P. Garcia and E. Vidal, Inference of k-testable languages in the strict sense and application to syntactic pattern recognition, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, issue.9, pp.920-925, 1990.
DOI : 10.1109/34.57687

J. Gillis and J. Van-den-bussche, Induction of Relational Algebra Expressions, Inductive Logic Programming (ILP), pp.25-33, 2009.
DOI : 10.1007/978-3-642-13840-9_4

M. Goebel and M. Ceresna, Wrapper induction, Encyclopedia of Database Systems, pp.3560-3565, 2009.

E. M. 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

M. J. Kearns and U. V. Vazirani, An introduction to computational learning theory, 1994.

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

A. Lemay, J. Niehren, and R. Gilleron, Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples, International Colloquium on Grammatical Inference (ICGI), pp.253-267, 2006.
DOI : 10.1007/11872436_21

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

L. Libkin, Logics for unranked trees: An overview, Logical Methods in Computer Science, vol.2, issue.3, 2006.

G. Miklau and D. Suciu, Containment and equivalence for a fragment of XPath, Journal of the ACM, vol.51, issue.1, pp.2-45, 2004.
DOI : 10.1145/962446.962448

T. Milo and D. Suciu, Index Structures for Path Expressions, International Conference on Database Theory (ICDT), pp.277-295, 1999.
DOI : 10.1007/3-540-49257-7_18

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

S. Miyano, A. Shinohara, and T. Shinohara, Polynomial-time learning of elementary formal systems, New Generation Computing, vol.13, issue.1, pp.217-242, 2000.
DOI : 10.1007/BF03037530

A. Morishima, H. Kitagawa, and A. Matsumoto, A machine learning approach to rapid development of XML mapping queries, Proceedings. 20th International Conference on Data Engineering, 2004.
DOI : 10.1109/ICDE.2004.1320004

F. Neven and T. Schwentick, XPath containment in the presence of disjunction, DTDs, and variables, International Conference on Database Theory (ICDT), pp.315-329, 2003.

J. Oncina and P. Garcia, Inference of rational tree sets, 1994.

J. Oncina and P. Gracia, Inferring regular languages in polynomial update time, Pattern Recognition and Image Analysis, 1991.

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

S. Raeymaekers, M. Bruynooghe, and J. Van-den-bussche, Learning (k,l)-contextual tree languages for information extraction from web pages, Machine Learning, pp.2-3155, 2008.
DOI : 10.1007/s10994-008-5049-7

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

A. D. Sarma, A. G. Parameswaran, H. Garcia-molina, and J. Widom, Synthesizing view definitions from data, International Conference on Database Theory (ICDT), pp.89-103, 2010.

T. Schwentick, XPath query containment, ACM SIGMOD Record, vol.33, issue.1, pp.101-109, 2004.
DOI : 10.1145/974121.974140

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

T. Shinohara, Polynomial time inference of extended regular pattern languages, RIMS Symposium on Software Science and Engineering, pp.115-127
DOI : 10.1007/3-540-11980-9_19

T. Shinohara and S. Arikawa, Pattern inference In Algorithmic Learning for Knowledge-Based Systems, pp.259-291, 1995.

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

J. W. Thatcher and W. J. , 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

Q. T. Tran, C. Chan, and S. Parthasarathy, Query by output, Proceedings of the 35th SIGMOD international conference on Management of data, SIGMOD '09, pp.535-548, 2009.
DOI : 10.1145/1559845.1559902