Search the dblp DataBase

Publications of Author

1. François Denis, Aurélien Lemay, Alain Terlutte
   Learning Regular Languages Using RFSA. [Citation Graph (0, 0)][DBLP]
   ALT, 2001, pp:348-363 [Conf]
   
2. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
   Residual Finite Tree Automata. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2003, pp:171-182 [Conf]
   
3. Julien Carme, Aurélien Lemay, Joachim Niehren
   Learning Node Selecting Tree Transducer from Completely Annotated Examples. [Citation Graph (0, 0)][DBLP]
   ICGI, 2004, pp:91-102 [Conf]
   
4. Aurélien Lemay, Joachim Niehren, Rémi Gilleron
   Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. [Citation Graph (0, 0)][DBLP]
   ICGI, 2006, pp:253-267 [Conf]
   
5. François Denis, Aurélien Lemay, Alain Terlutte
   Learning Regular Languages Using Non Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
   ICGI, 2000, pp:39-50 [Conf]
   
6. François Denis, Aurélien Lemay, Alain Terlutte
   Some Classes of Regular Languages Identifiable in the Limit from Positive Data. [Citation Graph (0, 0)][DBLP]
   ICGI, 2002, pp:63-76 [Conf]
   
7. Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont
   Learning Probabilistic Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
   ICGI, 2002, pp:77-91 [Conf]
   
8. François Denis, Aurélien Lemay, Alain Terlutte
   Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
   STACS, 2001, pp:144-157 [Conf]
   
9. François Denis, Aurélien Lemay, Alain Terlutte
   Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
   Fundam. Inform., 2002, v:51, n:4, pp:339-368 [Journal]
   
10. Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
    Interactive learning of node selecting tree transducer. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2007, v:66, n:1, pp:33-67 [Journal]
    
11. François Denis, Aurélien Lemay, Alain Terlutte
    Learning regular languages using RFSAs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:2, pp:267-294 [Journal]
    
12. Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
    Identification of biRFSA languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:212-223 [Journal]
    
13. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
    Residual Finite Tree Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
14. 
    ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. [Citation Graph (, )][DBLP]
    
    
15. 
    Retrieving meaningful relaxed tightest fragments for XML keyword search. [Citation Graph (, )][DBLP]
    
    
16. 
    Equivalence of Deterministic Nested Word to Word Transducers. [Citation Graph (, )][DBLP]
    
    
17. 
    Schema-Guided Induction of Monadic Queries. [Citation Graph (, )][DBLP]
    
    
18. 
    A learning algorithm for top-down XML transformations. [Citation Graph (, )][DBLP]
    
    
19. 
    Retrieving valid matches for XML keyword search. [Citation Graph (, )][DBLP]
    
    
20. 
    Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. [Citation Graph (, )][DBLP]