Learning Regular Languages Using Non Deterministic Finite Automata. - François Denis; Aurélien Lemay; Alain Terlutte (ICGI, 2000)

Learning Regular Languages Using RFSA. - François Denis; Aurélien Lemay; Alain Terlutte (ALT, 2001)

Some Classes of Regular Languages Identifiable in the Limit from Positive Data. - François Denis; Aurélien Lemay; Alain Terlutte (ICGI, 2002)

Learning Probabilistic Residual Finite State Automata. - Yann Esposito; Aurélien Lemay; François Denis; Pierre Dupont (ICGI, 2002)

Residual Finite State Automata. - François Denis; Aurélien Lemay; Alain Terlutte (Fundam. Informaticae, 2002)

Residual Finite Tree Automata. - Julien Carme; Rémi Gilleron; Aurélien Lemay; Alain Terlutte; Marc Tommasi (Developments in Language Theory, 2003)

Learning Node Selecting Tree Transducer from Completely Annotated Examples. - Julien Carme; Aurélien Lemay; Joachim Niehren (ICGI, 2004)

Learning regular languages using RFSAs. - François Denis; Aurélien Lemay; Alain Terlutte (Theor. Comput. Sci., 2004)

Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. - Aurélien Lemay; Joachim Niehren; Rémi Gilleron (ICGI, 2006)

Identification of biRFSA languages. - Michel Latteux; Aurélien Lemay; Yves Roos; Alain Terlutte (Theor. Comput. Sci., 2006)

Interactive learning of node selecting tree transducer. - Julien Carme; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (Mach. Learn., 2007)

Schema-Guided Induction of Monadic Queries. - Jérôme Champavère; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (ICGI, 2008)

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. - Jérôme Champavère; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (LATA, 2008)

ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. - Lingbo Kong; Rémi Gilleron; Aurélien Lemay (DASFAA, 2009)

Retrieving meaningful relaxed tightest fragments for XML keyword search. - Lingbo Kong; Rémi Gilleron; Aurélien Lemay (EDBT, 2009)

Equivalence of Deterministic Nested Word to Word Transducers. - Slawomir Staworko; Grégoire Laurence; Aurélien Lemay; Joachim Niehren (FCT, 2009)

Retrieving valid matches for XML keyword search. - Lingbo Kong; Rémi Gilleron; Aurélien Lemay (SAC, 2009)

Efficient inclusion checking for deterministic tree automata and XML Schemas. - Jérôme Champavère; Rémi Gilleron; Aurélien Lemay; Joachim Niehren (Inf. Comput., 2009)

A learning algorithm for top-down XML transformations. - Aurélien Lemay; Sebastian Maneth; Joachim Niehren (PODS, 2010)

Normalization of Sequential Top-Down Tree-to-Word Transducers. - Grégoire Laurence; Aurélien Lemay; Joachim Niehren; Slawek Staworko; Marc Tommasi (LATA, 2011)

Learning Rational Functions. - Adrien Boiret; Aurélien Lemay; Joachim Niehren (Developments in Language Theory, 2012)

Query induction with schema-guided pruning strategies. - Joachim Niehren; Jérôme Champavère; Aurélien Lemay; Rémi Gilleron (J. Mach. Learn. Res., 2013)

Approximate membership for regular languages modulo the edit distance. - Antoine Ndione; Aurélien Lemay; Joachim Niehren (Theor. Comput. Sci., 2013)

Learning Sequential Tree-to-Word Transducers. - Grégoire Laurence; Aurélien Lemay; Joachim Niehren; Slawek Staworko; Marc Tommasi (LATA, 2014)

A Paradigm for Learning Queries on Big Data. - Angela Bonifati; Radu Ciucanu; Aurélien Lemay; Slawek Staworko (Data4U@VLDB, 2014)

Learning Path Queries on Graph Databases. - Angela Bonifati; Radu Ciucanu; Aurélien Lemay (EDBT, 2015)

Interactive Path Query Specification on Graph Databases. - Angela Bonifati; Radu Ciucanu; Aurélien Lemay (EDBT, 2015)

Sublinear DTD Validity. - Antoine Ndione; Aurélien Lemay; Joachim Niehren (LATA, 2015)

Controlling Diversity in Benchmarking Graph Databases. - Guillaume Bagan; Angela Bonifati; Radu Ciucanu; George H. L. Fletcher; Aurélien Lemay; Nicky Advokaat (CoRR, 2015)

Learning Top-Down Tree Transducers with Regular Domain Inspection. - Adrien Boiret; Aurélien Lemay; Joachim Niehren (ICGI, 2016)

Generating Flexible Workloads for Graph Databases. - Guillaume Bagan; Angela Bonifati; Radu Ciucanu; George H. L. Fletcher; Aurélien Lemay; Nicky Advokaat (Proc. VLDB Endow., 2016)

gMark: Schema-Driven Generation of Graphs and Queries. - Guillaume Bagan; Angela Bonifati; Radu Ciucanu; George H. L. Fletcher; Aurélien Lemay; Nicky Advokaat (IEEE Trans. Knowl. Data Eng., 2017)

Machine Learning Techniques for Semistructured Data. (Techniques d'Apprentissage Automatique pour les Données Semistructurées). - Aurélien Lemay (2018)

Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. - Paul Gallot; Aurélien Lemay; Sylvain Salvati (MFCS, 2020)

Inference of Shape Expression Schemas Typed RDF Graphs. - Benoît Groz; Aurélien Lemay; Slawek Staworko; Piotr Wieczorek (CoRR, 2021)

Inference of Shape Graphs for Graph Databases. - Benoît Groz; Aurélien Lemay; Slawek Staworko; Piotr Wieczorek (ICDT, 2022)