S. Abiteboul, Querying Semi-Structured Data, ICDT, pp.1-18, 1997.

S. Abiteboul, P. Buneman, and D. Suciu, Data on the Web: From Relational to Semistructured Data and XML, 2000.

Y. Amsterdamer, S. B. Davidson, A. Kukliansky, T. Milo, S. Novgorodov et al., Managing general and individual knowledge in crowd mining applications, CIDR 2015, Seventh Biennial Conference on Innovative Data Systems Research, 2015.

S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, 1995.

R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, pp.1-43, 2009.
DOI : 10.1007/11779148_1

URL : http://www.cis.upenn.edu/~alur/Stoc04Dlt06.pdf

D. Angluin, Learning Regular Sets from Queries and Counterexamples. Information and Computation, vol.75, pp.87-106, 1987.
DOI : 10.1016/0890-5401(87)90052-6

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

D. Angluin, Learning Regular Sets from Queries and Counterexamples. Information and Computation, vol.75, pp.87-106, 1987.
DOI : 10.1016/0890-5401(87)90052-6

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

D. Angluin, Queries and Concept Learning, Machine Learning, vol.2, pp.319-342, 1988.
DOI : 10.1007/bf00116828

URL : https://link.springer.com/content/pdf/10.1007%2FBF00116828.pdf

R. A. Baeza-yates, Information retrieval in the web: beyond current search engines, Int. J. Approx. Reasoning, vol.34, issue.2-3, pp.97-104, 2003.
DOI : 10.1016/j.ijar.2003.07.002

URL : https://doi.org/10.1016/j.ijar.2003.07.002

G. Bagan, MSO Queries on Tree Decomposable Structures are Computable with Linear Delay, Computer Science Logic, vol.4646, pp.208-222, 2006.
DOI : 10.1007/11874683_11

A. Barabási, Linked-how everything is connected to everything else and what it means for business, science, and everyday life, 2003.

A. Bonifati, R. Ciucanu, and A. Lemay, Interactive path query specification on graph databases, Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, pp.505-508, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01187975

A. Bonifati, R. Ciucanu, and A. Lemay, Learning path queries on graph databases, Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, pp.109-120, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01187966

I. Ben-gal, Bayesian networks. Encyclopedia of statistics in quality and reliability, 2007.

M. Bernard and C. Higuera, GIFT: Grammatical Inference for Terms, ILP, 1999.

B. Bollig, P. Habermehl, M. Leucker, and B. Monmege, A Fresh Approach to Learning Register Automata, Developments in Language Theory, vol.7907, pp.118-130, 2013.
DOI : 10.1007/978-3-642-38771-5_12

URL : https://hal.archives-ouvertes.fr/hal-00908998

R. A. Baeza-yates, C. A. Hurtado, and M. Mendoza, Query recommendation using query logs in search engines, Current Trends in Database TechnologyEDBT 2004 Workshops, EDBT 2004 Workshops PhD, DataX, PIM, P2P&DB, and ClustWeb, pp.588-596, 2004.
DOI : 10.1007/978-3-540-30192-9_58

C. M. Bishop, Neural networks for pattern recognition, 1995.

M. Benedikt and C. Koch, XPath leashed, ACM Computing Surveys, vol.41, issue.1, pp.1-54, 2008.
DOI : 10.1145/1456650.1456653

M. Benedikt and C. Koch, From XQuery to relational logics, ACM Transactions on Database Systems, vol.34, issue.4, 2009.
DOI : 10.1145/1620585.1620592

A. Brüggemann-klein, M. Murata, and D. Wood, Regular Tree and Regular Hedge Languages over Unranked Alphabets: Version 1, 2001.

P. Barcelo and L. Libkin, Temporal Logics over Unranked Trees, 20th Annual IEEE Symposium on Logic in Computer Science, pp.31-40, 2005.
DOI : 10.1109/lics.2005.51

A. Boiret, A. Lemay, and J. Niehren, Learning Rational Functions, Developments in Language Theory, vol.7410, pp.273-283, 2012.
DOI : 10.1007/978-3-642-31653-1_25

URL : https://hal.archives-ouvertes.fr/hal-00692341

A. Boiret, A. Lemay, and J. Niehren, Learning Top-Down Tree Transducers with Regular Domain Inspection, International Conference on Grammatical Inference, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01357186

M. Benedikt, C. Ley, and G. Puppis, What you must remember when processing data words, Proceedings of the 4th
URL : https://hal.archives-ouvertes.fr/hal-00717773

, CEUR Workshop Proceedings. CEUR-WS.org, vol.619, 2010.

M. Boja´nczykboja´nczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David, Two-Variable Logic on Words with Data, 21st Annual IEEE Symposium on Logic in Computer Science, pp.7-16, 2006.

A. Boiret, Normalization and Learning of Transducers on Trees and Words. (Normalisation et Apprentissage de Transducteurs d'Arbres et de Mots), 2016.
URL : https://hal.archives-ouvertes.fr/tel-01396543

A. E. Borthwick, A Maximum Entropy Approach to Named Entity Recognition, p.9945252, 1999.

A. Boiret and R. Palenta, Deciding equivalence of linear tree-to-word transducers in polynomial time, Developments in Language Theory-20th International Conference, DLT 2016, pp.355-367, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01429110

A. Bordes, J. Weston, R. Collobert, and Y. Bengio, Learning structured embeddings of knowledge bases, Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI'11, pp.301-306, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00752498

M. E. Califf, Relational learning techniques for natural language information extraction, 1998.

J. Carme, Inférence de requêtesrégulì eres dans les arbres et applicationsàapplicationsà l'extraction d'information sur le Web, vol.3, 2005.

J. Clark and S. Derose, XML path language (XPath) version 1.0. W3C recommendation, W3C, 1999.

H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez et al., Tree Automata Techniques and Applications. Available on, 2002.

J. Carme, R. Gilleron, A. Lemay, and J. Niehren, Interactive Learning of Node Selecting Tree Transducers, IJCAI Workshop on Grammatical Inference, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00087226

J. Carme, R. Gilleron, A. Lemay, and J. Niehren, Interactive Learning of Node Selecting Tree Transducers, Machine Learning, vol.66, pp.33-67, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00087226

J. Champavère, R. Gilleron, A. Lemay, and J. Niehren, Efficient inclusion checking for deterministic tree automata and DTDs, 2nd International Conference on Language and Automata Theory and Applications, 2008.

J. Champavère, R. Gilleron, A. Lemay, and J. Niehren, Schema-Guided Induction of Monadic Queries, 9th International Colloquium on Grammatical Inference, vol.5278, pp.15-28, 2008.

J. Champavère, R. Gilleron, A. Lemay, and J. Niehren, Efficient inclusion checking for deterministic tree automata and XML schemas, Information and Computation, vol.207, issue.11, pp.1181-1208, 2009.

J. Champavère, R. Gilleron, A. Lemay, and J. Niehren, Schema-Guided Query Induction, 2010.

D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi, Rewriting of regular expressions and regular path queries, Journal of Computer and System Sciences, vol.64, issue.3, pp.443-465, 2002.
DOI : 10.1145/303976.303996

J. Champavère, Induction de requêtes guidée par schéma, 2010.

C. Choffrut, A generalization of Ginsburg and Rose's characterisation of g-s-m mappings, ICALP 79, number 71 in Lecture Notes in Computer Science, pp.88-103, 1979.

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

URL : https://doi.org/10.1016/s0304-3975(01)00219-5

R. Ciucanu, Cross-Model Queries and Schemas: Complexity and Learning. Theses, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01182649

J. Clark, XSL transformations (XSLT) version 1.0. W3C recommendation, W3C, 1999.

J. Carme, A. Lemay, and J. Niehren, Learning Node Selecting Tree Transducer from Completely Annotated Examples, 7th International Colloquium on Grammatical Inference, vol.3264, pp.91-102, 2004.
DOI : 10.1007/978-3-540-30195-0_9

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

K. Ashok, P. M. Chandra, and . Merlin, Optimal implementation of conjunctive queries in relational data bases, 9th ACM Symposium on Theory of Computing, pp.77-90, 1977.

I. F. Cruz, A. O. Mendelzon, and P. T. Wood, A graphical query language supporting recursion, SIGMOD Rec, vol.16, issue.3, pp.323-330, 1987.
DOI : 10.1145/38714.38749

I. F. Cruz, A. O. Mendelzon, and P. T. Wood, A graphical query language supporting recursion, SIGMOD Rec, vol.16, issue.3, pp.323-330, 1987.
DOI : 10.1145/38714.38749

H. L. Chieu and H. T. Ng, A maximum entropy approach to information extraction from semi-structured and free text, Proceedings of Eighteenth national conference on Artificial intelligence, pp.786-791, 2002.

J. Carme, J. Niehren, and M. Tommasi, Querying Unranked Trees with Stepwise Tree Automata, 19th International Conference on Rewriting Techniques and Applications, vol.3091, pp.105-118, 2004.
DOI : 10.1007/978-3-540-25979-4_8

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

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

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

B. Courcelle, Monadic second-order definable graph transductions: a survey, Theoretical Computer Science, vol.126, issue.1, pp.53-75, 1994.
DOI : 10.1016/0304-3975(94)90268-2

URL : https://doi.org/10.1016/0304-3975(94)90268-2

B. Courcelle, Handbook of Graph Grammars and Computing by Graph Transformations, Handbook of Graph Grammars, vol.1, 1997.

B. Courcelle, Linear delay enumeration and monadic second-order logic, Discrete Applied Mathematics, vol.157, issue.12, pp.2675-2700, 2009.
DOI : 10.1016/j.dam.2008.08.021

URL : https://hal.archives-ouvertes.fr/hal-00333846

B. Chidlovskii, J. Ragetli, and M. De-rijke, Wrapper generation via grammar induction, Proceedings European Conference on Machine Learning (ECML'2000), 2000.
DOI : 10.1007/3-540-45164-1_11

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-45164-1_11.pdf

D. Crockford, Nosql definition: : Next generation databases mostly addressing some of the points: being nonrelational, distributed, open-source and horizontally scalable, 2009.

D. Crockford, Json specification, IETF, 2014.

, Cascading style sheets, pp.2017-2026

O. Chapelle, B. Schlkopf, and A. Zien, Semi-Supervised Learning, 2010.

A. Doan, A. Halevy, and Z. Ives, Principles of Data Integration, 2012.

N. Decker, P. Habermehl, M. Leucker, and D. Thoma, Learning Transparent Data Automata, pp.130-149, 2014.
DOI : 10.1007/978-3-319-07734-5_8

C. De-la-higuera, Characteristic Sets for Polynomial Grammatical Inference, Machine Learning, vol.27, pp.125-137, 1997.

C. De-la-higuera and J. C. Janodet, Inference of omegalanguages from prefixes, Theoretical Computer Science, vol.313, issue.2, pp.295-312, 2004.

J. Engelfriet and B. Courcelle, Graph Structure and Monadic Second-order Logic, Number 138 in Encyclopedia of Mathematics and its Applications, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00646514

S. Eilenberg, Automata, Languages and Machines, 1974.

B. S. Everitt, S. Landau, and M. Leese, Cluster Analysis, 2009.
DOI : 10.1002/9780470977811

URL : https://onlinelibrary.wiley.com/doi/pdf/10.1002/9780470977811.fmatter

C. C. Elgot and G. Mezei, On relations defined by generalized finite automata, IBM J. of Res. and Dev, vol.9, pp.88-101, 1965.
DOI : 10.1147/rd.91.0047

J. Engelfriet and S. Maneth, Macro tree translations of linear size increase are MSO definable, SIAM J. Comput, vol.32, pp.950-1006, 2003.
DOI : 10.1137/s0097539701394511

J. Engelfriet and S. Maneth, The equivalence problem for deterministic MSO tree transducers is decidable, Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science-FSTTCS'2005, vol.3821, pp.495-504, 2005.
DOI : 10.1007/11590156_40

URL : http://arxiv.org/pdf/cs/0506014

J. Engelfriet, S. Maneth, and H. Seidl, Deciding equivalence of top-down XML transformations in polynomial time, Journal of Computer and System Science, vol.75, issue.5, pp.271-286, 2009.

J. Engelfriet, Tree automata and tree grammars, 1975.

J. Engelfriet, Top-down tree transducers with regular lookahead, vol.10, pp.289-303, 1976.
DOI : 10.7146/dpb.v4i49.6468

URL : https://tidsskrift.dk/daimipb/article/download/6468/5587

J. Engelfriet, Top-down tree transducers with regular lookahead, Math. Systems Theory, vol.10, pp.289-303, 1977.
DOI : 10.7146/dpb.v4i49.6468

URL : https://tidsskrift.dk/daimipb/article/download/6468/5587

J. Engelfriet and H. Vogler, Macro tree transducers, J. Comp. Syst. Sci, vol.31, pp.71-146, 1985.

D. Freitag and N. Kushmerick, Boosted wrapper induction, pp.577-583, 2000.

D. Freitag and N. Kushmerick, Boosted Wrapper Induction, 17-th National Conference on Artificial Intelligence, 2000.

R. Fagin, G. Phokion, R. J. Kolaitis, L. Miller, and . Popa, Data exchange: semantics and query answering, Theoretical Computer Science, vol.336, issue.1, pp.89-124, 2005.
DOI : 10.1007/3-540-36285-1_14

D. Freitag and A. K. Mccallum, Information extraction with HMMs and shrinkage, AAAI Workshop on Machine Learning for Information Extraction, 1999.

D. Freitag, Machine learning for information extraction in informal domains, Machine Learning, vol.39, pp.169-202, 2000.

E. Filiot, J. Raskin, P. Reynier, F. Servais, and J. Talbot, Properties of Visibly Pushdown Transducers, 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10), vol.6281, pp.355-367, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00492241

S. Friese, H. Seidl, and S. Maneth, Minimization of Deterministic Bottom-Up Tree Transducers, Developments in Language Theory, 14th International Conference DLT 2010, vol.6224, pp.185-196, 2010.
DOI : 10.1007/978-3-642-14455-4_18

G. Gottlob and C. Koch, Monadic Datalog and the expressive power of languages for Web information extraction, Journal of the ACM, vol.51, issue.1, pp.74-113, 2004.

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing XPath queries, ACM Transactions on Database Systems, vol.30, issue.2, pp.444-491, 2005.
DOI : 10.1145/1071610.1071614

V. Ramanathan, R. Guha, E. Mccool, and . Miller, Semantic search, Proceedings of the Twelfth International World Wide Web Conference, pp.700-709, 2003.

R. Gilleron, P. Marty, M. Tommasi, and F. Torre, Interactive Tuples Extraction from Semi-Structured Data, IEEE/WIC/ACM International Conference on Web Intelligence, 2006.
DOI : 10.1109/wi.2006.102

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

P. García and J. Oncina, Inference of Recognizable Tree Sets, 1993.

E. M. Gold, Complexity of Automaton Identification from Given Data, Inform. Control, vol.37, pp.302-320, 1978.

M. Haghighat, M. Abdel-mottaleb, and W. Alhalabi, Discriminant correlation analysis: Realtime feature level fusion for multimodal biometric recognition, Trans. Info. For. Sec, vol.11, issue.9, pp.1984-1996, 2016.
DOI : 10.1109/tifs.2016.2569061

URL : https://zenodo.org/record/889881/files/article.pdf

I. Hickson, Html5 specification. Technical Report 1.5610, World Wide Web Consortium, 2012.

H. Isozaki and H. Kazawa, Efficient support vector classifiers for named entity recognition, Proceedings of the 19th International Conference on Computational Linguistics, vol.1, pp.1-7, 2002.
DOI : 10.3115/1072228.1072282

URL : http://dl.acm.org/ft_gateway.cfm?id=1072282&type=pdf

M. O. Jackson, Social and Economic Networks, 2008.

T. Joachims, T. Finley, and C. Yu, Cutting-plane training of structural svms, Machine Learning, vol.77, pp.27-59, 2009.

R. Kosala, H. Blockeel, M. Bruynooghe, and J. Van-den-bussche, Information extraction from structured documents using k-testable tree automaton inference, Data Knowl. Eng, vol.58, issue.2, pp.129-158, 2006.
DOI : 10.1016/j.datak.2005.05.002

URL : http://alpha.luc.ac.be/~lucp1080/gltestable.pdf

M. Kaminski and N. Francez, Finite-memory automata, Theor. Comput. Sci, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1109/fscs.1990.89590

M. Kaminski and N. Francez, Finite-memory automata, Theor. Comput. Sci, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1109/fscs.1990.89590

J. Karhumäki and W. Plandowski, On the Size of Independent Systems of Equations in Semigroups, Lecture Notes in Computer Science, vol.841, pp.443-452, 1994.

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

R. Kosala, J. Van-den, M. Bussche, H. Bruynooghe, and . Blockeel, Information Extraction in Structured Documents using Tree Automata Induction, 6th International Conference Principles of Data Mining and Knowledge Discovery, pp.299-310, 2002.
DOI : 10.1007/3-540-45681-3_25

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-45681-3_25.pdf

K. J. Lang, Random DFA's can be approximately learned from sparse uniform examples, Proc. 5th Annu. Workshop on Comput. Learning Theory, pp.45-52, 1992.
DOI : 10.1145/130385.130390

G. Laurence, Normalisation et Apprentissage de Transductions dâ??Arbres en Mots, Université Lille 1, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01053084

L. Libkin, Logics over unranked trees: an overview, Logical Methods in Computer Science, vol.3, issue.2, pp.1-31, 2006.
DOI : 10.1007/11523468_4

URL : http://arxiv.org/pdf/cs/0606062

J. Lehmann, R. Isele, M. Jakob, A. Jentzsch, D. Kontokostas et al., Dbpedia-A large-scale, multilingual knowledge base extracted from wikipedia, Semantic Web, vol.6, issue.2, pp.167-195, 2015.

G. Laurence, A. Lemay, J. Niehren, S. Staworko, and M. Tommasi, Normalization of Sequential Top-Down Tree-to-Word Transducers, Lecture Notes in Computer Science, vol.6638, pp.354-365
URL : https://hal.archives-ouvertes.fr/inria-00566291

. Springer, , 2011.

G. Laurence, A. Lemay, J. Niehren, S. Staworko, and M. Tommasi, Learning Sequential Treeto-Word Transducers, 8th International Conference on Language and Automata Theory and Applications, 2014.
DOI : 10.1007/978-3-319-04921-2_40

URL : https://www.pure.ed.ac.uk/ws/files/19314071/Lawrence_Lemay_ET_AL_2014_Learning_Sequential_Tree_to_Word_Transducers.pdf

A. Lemay, S. Maneth, and J. Niehren, A Learning Algorithm for Top-Down XML Transformations, 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.285-296, 2010.
DOI : 10.1145/1807085.1807122

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

A. Lemay, S. Maneth, and J. Niehren, A Learning Algorithm for Top-Down XML Transformations, Acm, editor, 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.285-296, 2010.
DOI : 10.1145/1807085.1807122

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

J. D. Lafferty, A. Mccallum, and F. C. Pereira, Conditional random fields: Probabilistic models for segmenting and labeling sequence data, Proceedings of the Eighteenth International Conference on Machine Learning, ICML '01, pp.282-289, 2001.

A. Lemay, J. Niehren, and R. Gilleron, Learning $n$-Ary Node Selecting Tree Transducers from Completely Annotated Examples, 8-th International Colloquium on Grammatical Inference, 2006.
DOI : 10.1007/11872436_21

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

M. Mahemoff, Ajax Design Patterns, 2006.

M. Marx, Conditional XPath. ACM Transactions on Database Systems, vol.30, issue.4, pp.929-959, 2005.

P. Marty, Induction d'extraction n-aire pour les documents semi-structurés, vol.3, 2007.

M. Marx and . Maarten-de-rijke, Semantic characterizations of navigational XPath, ACM SIGMOD Record, vol.34, issue.2, pp.41-46, 2005.
DOI : 10.1145/1083784.1083792

URL : http://staff.science.uva.nl/%7Emarx/pub/recent/tdm-mm.pdf

H. George and . Mealy, A method for synthesizing sequential circuits, Bell System Technical Journal, vol.34, issue.5, pp.1045-1079, 1955.

I. Muslea, S. Minton, and C. A. Knoblock, A hierarchical approach to wrapper induction, Agents, pp.190-197, 1999.
DOI : 10.1145/301136.301191

J. Mayfield, P. Mcnamee, and C. Piatko, Named entity recognition using hundreds of thousands of features, Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL 2003, vol.4, pp.184-187, 2003.
DOI : 10.3115/1119176.1119205

URL : http://dl.acm.org/ft_gateway.cfm?id=1119205&type=pdf

A. Manuel, A. Muscholl, and G. Puppis, Walking on data words, Computer Science-Theory and Applications-8th International Computer Science Symposium in Russia, pp.64-75, 2013.
DOI : 10.1007/978-3-642-38536-0_6

URL : https://hal.archives-ouvertes.fr/hal-00877065

E. F. Moore, Gedanken Experiments on Sequential Machines, Automata Studies, pp.129-153, 1956.

E. Maler, J. Paoli, C. M. Sperberg-mcqueen, F. Yergeau, and T. Bray, Extensible markup language (XML) 1.0 (third edition), p.3, 2004.

M. Murata, Hedge Automata: a Formal Model for XML Schemata, 2000.

J. Myhill, Finite Automata and the Representation of Events, 1957.

H. Duy, Z. Ngo, and . Bellahsene, YAM++ : (not) Yet Another Matcher for Ontology Matching Task, BDA: Bases de Données Avancées, 2012.

J. Niehren, J. Champavère, R. Gilleron, and A. Lemay, Query Induction with Schema-Guided Pruning Strategies, 2012.
URL : https://hal.archives-ouvertes.fr/inria-00607121

J. Niehren, J. Champavère, R. Gilleron, and A. Lemay, Query Induction with Schema-Guided Pruning Strategies, Journal of Machine Learning Research, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00607121

. Antoine-mbaye-ndione, Approximate membership for words and trees, 2015.

A. Nerode, Linear Automaton Transformation, Proc, vol.9, pp.541-544, 1958.

A. Ndione, A. Lemay, and J. Niehren, Approximate membership for regular languages modulo the edit distance, Theor. Comput. Sci, vol.487, pp.37-49, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00801970

J. Niehren, L. Planque, J. Talbot, and S. Tison, N-ary queries by tree automata, Foundations of Semistructured Data, pp.6-11, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00536522

F. Neven, T. Schwentick, and V. Vianu, Finite state machines for strings over infinite alphabets, ACM Trans. Comput. Logic, vol.5, issue.3, pp.403-435, 2004.

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.

J. Oncina, P. Garcia, and E. Vidal, Learning Subsequential Transducers for Pattern Recognition and Interpretation Tasks, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, pp.448-458, 1993.

J. Oncina and M. A. Varo, Using domain information during the learning of a subsequential transducer, ICGI 1996, vol.1147, pp.313-325, 1996.

A. Potthoff, Modulo-counting quantifiers over finite trees, Theoretical Computer Science, vol.126, issue.1, pp.97-112, 1994.

H. Park, R. Pang, A. G. Parameswaran, H. Garcia-molina, N. Polyzotis et al., Deco: A system for declarative crowdsourcing, vol.5, pp.1990-1993, 2012.

J. R. Quinlan, Simplifying decision trees, Int. J. Man-Mach. Stud, vol.27, issue.3, pp.221-234, 1987.

M. O. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees, Transactions of the American Mathematical Society, vol.141, pp.1-35, 1969.

S. Raeymaekers, M. Bruynooghe, and J. Van-den-bussche, Learning (k,l)-Contextual Tree Languages for Information Extraction from Web Pages, Machine Learning, vol.71, pp.155-183, 2008.

S. Ganesh-ramakrishnan, S. Joshi, A. Balakrishnan, and . Srinivasan, Using ILP to Construct Features for Information Extraction from Semi-structured Text, pp.211-224, 2008.

W. C. Rounds, Mappings and grammars on trees, Math. Systems Theory, vol.4, pp.257-287, 1970.

C. Reutenauer and M. P. Schützenberger, Minimalization of rational word functions, SIAM Journal on Computing, vol.20, pp.669-685, 1991.

F. Jean-françois-raskin and . Servais, Visibly Pushdown Transducers, Automata, Languages and Programming, 35th International Colloquium, vol.5126, pp.386-397

J. Robie, J. Simeon, D. Chamberlin, D. Florescu, M. Fernandez et al., XQuery 1.0: An XML query language (second edition). W3C recommendation, W3C, 2010.

M. P. Schützenberger, Sur une variante des fonctions sequentielles, Theor. Comput. Sci, vol.4, issue.1, pp.47-57, 1977.

J. Pramod, M. Sadalage, and . Fowler, NoSQL distilled : a brief guide to the emerging world of polyglot persistence, 2013.

S. Staworko, G. Laurence, A. Lemay, and J. Niehren, Equivalence of Nested Word to Word Transducers, 17th International Symposium on Fundamentals of Computer Theory, vol.5699, pp.310-322, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00423961

S. Soderland, Learning Information Extraction Rules for Semi-Structured and Free Text, Machine Learning, vol.34, pp.233-272, 1999.

S. Soderland, Learning information extraction rules for semi-structured and free text, Machine Learning, vol.34, pp.2017-2026, 1999.

B. Scholkopf and A. J. Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond, 2001.

G. Balder-ten-cate, T. Fontaine, and . Litak, Some modal aspects of xpath, Journal of Applied Non-Classical Logics, vol.20, issue.3, pp.139-171, 2010.

C. Balder-ten and M. Marx, Axiomatizing the logical core of XPath 2.0, International Conference on Database Theory, 2007.

I. Tsochantaridis, T. Hofmann, T. Joachims, and Y. Altun, Support vector machine learning for interdependent and structured output spaces, International Conference on Machine Learning (ICML), pp.104-112, 2004.

W. Thomas, Handbook of Theoretical Computer Science, volume B, chapter Automata on Infinite Objects, pp.134-191, 1990.

B. A. Trakhtenbrot, Impossibility of an algorithm for the decision problem in finite classes, Doklady Akademii Nauk SSSR, vol.70, pp.569-572, 1950.

J. W. Thatcher and J. B. Wright, Generalized finite automata with an application to a decision problem of second-order logic, Mathematical System Theory, vol.2, pp.57-82, 1968.

, Xml schema part 1: Structures, pp.2017-2026

M. Yannakakis, Algorithms for Acyclic Database Schemes, Proceeding of VLDB, pp.82-94, 1981.