- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j13 |      | Frédéric Tantini, Alain Terlutte, Fabien Torre: Combinaisons d'automates et de boules de mots pour la classification de séquences. Revue d'Intelligence Artificielle 25(3): 411-434 (2011) |
| 2010 | ||
| c10 | | Frédéric Tantini, Alain Terlutte, Fabien Torre: Sequences Classification by Least General Generalisations. ICGI 2010: 189-202 |
| 2009 | ||
| j12 | | Michel Latteux, Yves Roos, Alain Terlutte: Minimal NFA and biRFSA Languages. ITA 43(2): 221-237 (2009) |
| 2006 | ||
| j11 | | Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte: Identification of biRFSA languages. Theor. Comput. Sci. 356(1-2): 212-223 (2006) |
| i1 | | Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. CoRR abs/cs/0609015 (2006) |
| 2004 | ||
| j10 | | François Denis, Aurélien Lemay, Alain Terlutte: Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004) |
| 2003 | ||
| c9 | | Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182 |
| 2002 | ||
| j9 | | François Denis, Aurélien Lemay, Alain Terlutte: Residual Finite State Automata. Fundam. Inform. 51(4): 339-368 (2002) |
| j8 | | Zoltán Fülöp, Alain Terlutte: Iterated relabeling tree transducers. Theor. Comput. Sci. 276(1-2): 221-244 (2002) |
| c8 | | François Denis, Aurélien Lemay, Alain Terlutte: Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI 2002: 63-76 |
| 2001 | ||
| c7 | | François Denis, Aurélien Lemay, Alain Terlutte: Learning Regular Languages Using RFSA. ALT 2001: 348-363 |
| c6 | | |
| 2000 | ||
| j7 | | |
| j6 | | David Simplot, Alain Terlutte: Closure under union and composition of iterated rational transductions. ITA 34(3): 183-212 (2000) |
| c5 | | François Denis, Aurélien Lemay, Alain Terlutte: Learning Regular Languages Using Non Deterministic Finite Automata. ICGI 2000: 39-50 |
| 1998 | ||
| c4 | | Michel Latteux, David Simplot, Alain Terlutte: Iterated Length-Preserving Rational Transductions. MFCS 1998: 286-295 |
| 1996 | ||
| j5 | | Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte: On Computational Power of Weighted Finite Automata. Fundam. Inform. 25(3): 285-293 (1996) |
| 1994 | ||
| j4 |  | Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte: On Continuous Functions Computed by Finite Automata. ITA 28(3-4): 387-403 (1994) |
| j3 | | Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte: Representation of Rational Functions with Prefix and Suffix Codings. Theor. Comput. Sci. 134(2): 403-413 (1994) |
| 1993 | ||
| c3 | | Denis Derencourt, Alain Terlutte: Compositions of Codings. Developments in Language Theory 1993: 30-43 |
| 1992 | ||
| c2 | | Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte: On Computational Power of Weighted Finite Automata. MFCS 1992: 236-245 |
| 1990 | ||
| j2 | | Alain Terlutte: Cyclic Rational Transductions and Polynomials of Rational Functions. Theor. Comput. Sci. 70(2): 261-271 (1990) |
| 1988 | ||
| c1 | | Alain Terlutte: Cyclic Rational Transductions and Polynomials of Rational Functions. STACS 1988: 149-158 |
| 1987 | ||
| j1 | | |
Data released under the ODC-BY 1.0 license — See also our legal information page