- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c17 |      | Adrien Boiret, Aurélien Lemay, Joachim Niehren: Learning Rational Functions. Developments in Language Theory 2012: 273-283 |
| 2011 | ||
| c16 | | Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi: Normalization of Sequential Top-Down Tree-to-Word Transducers. LATA 2011: 354-365 |
| 2010 | ||
| c15 | | Aurélien Lemay, Sebastian Maneth, Joachim Niehren: A learning algorithm for top-down XML transformations. PODS 2010: 285-296 |
| 2009 | ||
| j5 | | Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Efficient inclusion checking for deterministic tree automata and XML Schemas. Inf. Comput. 207(11): 1181-1208 (2009) |
| c14 | | Lingbo Kong, Rémi Gilleron, Aurélien Lemay: ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. DASFAA 2009: 543-548 |
| c13 | | Lingbo Kong, Rémi Gilleron, Aurélien Lemay: Retrieving meaningful relaxed tightest fragments for XML keyword search. EDBT 2009: 815-826 |
| c12 | | Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren: Equivalence of Deterministic Nested Word to Word Transducers. FCT 2009: 310-322 |
| c11 | | Lingbo Kong, Rémi Gilleron, Aurélien Lemay: Retrieving valid matches for XML keyword search. SAC 2009: 1536-1540 |
| 2008 | ||
| c10 | | Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Schema-Guided Induction of Monadic Queries. ICGI 2008: 15-28 |
| c9 | | Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA 2008: 184-195 |
| 2007 | ||
| j4 | | Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Interactive learning of node selecting tree transducer. Machine Learning 66(1): 33-67 (2007) |
| 2006 | ||
| j3 | | Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte: Identification of biRFSA languages. Theor. Comput. Sci. 356(1-2): 212-223 (2006) |
| c8 | | Aurélien Lemay, Joachim Niehren, Rémi Gilleron: Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI 2006: 253-267 |
| i1 | | Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. CoRR abs/cs/0609015 (2006) |
| 2004 | ||
| j2 | | François Denis, Aurélien Lemay, Alain Terlutte: Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004) |
| c7 | | Julien Carme, Aurélien Lemay, Joachim Niehren: Learning Node Selecting Tree Transducer from Completely Annotated Examples. ICGI 2004: 91-102 |
| 2003 | ||
| c6 | | Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182 |
| 2002 | ||
| j1 | | François Denis, Aurélien Lemay, Alain Terlutte: Residual Finite State Automata. Fundam. Inform. 51(4): 339-368 (2002) |
| c5 | | François Denis, Aurélien Lemay, Alain Terlutte: Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI 2002: 63-76 |
| c4 | | Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont: Learning Probabilistic Residual Finite State Automata. ICGI 2002: 77-91 |
| 2001 | ||
| c3 | | François Denis, Aurélien Lemay, Alain Terlutte: Learning Regular Languages Using RFSA. ALT 2001: 348-363 |
| c2 | | |
| 2000 | ||
| c1 | | François Denis, Aurélien Lemay, Alain Terlutte: Learning Regular Languages Using Non Deterministic Finite Automata. ICGI 2000: 39-50 |
Data released under the ODC-BY 1.0 license — See also our legal information page