Sur Les Centres De Dol-Languages. - Alain Terlutte (RAIRO Theor. Informatics Appl., 1987)

Cyclic Rational Transductions and Polynomials of Rational Functions. - Alain Terlutte (Theor. Comput. Sci., 1990)

Compositions of Codings. - Denis Derencourt; Alain Terlutte (Developments in Language Theory, 1993)

On Continuous Functions Computed by Finite Automata. - Denis Derencourt; Juhani Karhumäki; Michel Latteux; Alain Terlutte (RAIRO Theor. Informatics Appl., 1994)

Representation of Rational Functions with Prefix and Suffix Codings. - Tero Harju; H. C. M. Kleijn; Michel Latteux; Alain Terlutte (Theor. Comput. Sci., 1994)

On Computational Power of Weighted Finite Automata. - Denis Derencourt; Juhani Karhumäki; Michel Latteux; Alain Terlutte (Fundam. Informaticae, 1996)

Iterated Length-Preserving Rational Transductions. - Michel Latteux; David Simplot; Alain Terlutte (MFCS, 1998)

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

Closure under union and composition of iterated rational transductions. - David Simplot; Alain Terlutte (RAIRO Theor. Informatics Appl., 2000)

Iteration of rational transductions. - Alain Terlutte; David Simplot (RAIRO Theor. Informatics Appl., 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)

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

Iterated relabeling tree transducers. - Zoltán Fülöp 001; Alain Terlutte (Theor. Comput. Sci., 2002)

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

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

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

Minimal NFA and biRFSA Languages. - Michel Latteux; Yves Roos; Alain Terlutte (RAIRO Theor. Informatics Appl., 2009)

Sequences Classification by Least General Generalisations. - Frédéric Tantini; Alain Terlutte; Fabien Torre (ICGI, 2010)

Combinaisons d'automates et de boules de mots pour la classification de séquences. - Frédéric Tantini; Alain Terlutte; Fabien Torre (Rev. d'Intelligence Artif., 2011)