Alain Terlutte

Publication Activity (10 Years)

Years Active: 1987-2011
Publications (10 Years): 0

Publications

Frédéric Tantini, Alain Terlutte, Fabien Torre
Combinaisons d'automates et de boules de mots pour la classification de séquences. Rev. d'Intelligence Artif. 25 (3) (2011)
Frédéric Tantini, Alain Terlutte, Fabien Torre
Sequences Classification by Least General Generalisations. ICGI (2010)
Michel Latteux, Yves Roos, Alain Terlutte
Minimal NFA and biRFSA Languages. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
Residual Finite Tree Automata CoRR (2006)
Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
Identification of biRFSA languages. Theor. Comput. Sci. 356 (1-2) (2006)
François Denis, Aurélien Lemay, Alain Terlutte
Learning regular languages using RFSAs. Theor. Comput. Sci. 313 (2) (2004)
Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
Residual Finite Tree Automata. Developments in Language Theory (2003)
Zoltán Fülöp, Alain Terlutte
Iterated relabeling tree transducers. Theor. Comput. Sci. 276 (1-2) (2002)
François Denis, Aurélien Lemay, Alain Terlutte
Residual Finite State Automata. Fundam. Informaticae 51 (4) (2002)
François Denis, Aurélien Lemay, Alain Terlutte
Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI (2002)
François Denis, Aurélien Lemay, Alain Terlutte
Learning Regular Languages Using RFSA. ALT (2001)
François Denis, Aurélien Lemay, Alain Terlutte
Residual Finite State Automata. STACS (2001)
François Denis, Aurélien Lemay, Alain Terlutte
Learning Regular Languages Using Non Deterministic Finite Automata. ICGI (2000)
David Simplot, Alain Terlutte
Closure under union and composition of iterated rational transductions. RAIRO Theor. Informatics Appl. 34 (3) (2000)
Alain Terlutte, David Simplot
Iteration of rational transductions. RAIRO Theor. Informatics Appl. 34 (2) (2000)
Michel Latteux, David Simplot, Alain Terlutte
Iterated Length-Preserving Rational Transductions. MFCS (1998)
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
On Computational Power of Weighted Finite Automata. Fundam. Informaticae 25 (3) (1996)
Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte
Representation of Rational Functions with Prefix and Suffix Codings. Theor. Comput. Sci. 134 (2) (1994)
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
On Continuous Functions Computed by Finite Automata. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Denis Derencourt, Alain Terlutte
Compositions of Codings. Developments in Language Theory (1993)
Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte
On Computational Power of Weighted Finite Automata. MFCS (1992)
Alain Terlutte
Cyclic Rational Transductions and Polynomials of Rational Functions. Theor. Comput. Sci. 70 (2) (1990)
Alain Terlutte
Cyclic Rational Transductions and Polynomials of Rational Functions. STACS (1988)
Alain Terlutte
Sur Les Centres De Dol-Languages. RAIRO Theor. Informatics Appl. 21 (2) (1987)