Alain Terlutte

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