Alain Terlutte

According to our database, Alain Terlutte authored at least 20 papers between 1987 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

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

2010

Sequences Classification by Least General Generalisations.

Frédéric Tantini, Alain Terlutte, Fabien Torre

Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

2009

Minimal NFA and biRFSA Languages.

Michel Latteux, Yves Roos, Alain Terlutte

RAIRO Theor. Informatics Appl., 2009

2006

Identification of biRFSA languages.

Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte

Theor. Comput. Sci., 2006

2004

Learning regular languages using RFSAs.

François Denis, Aurélien Lemay, Alain Terlutte

Theor. Comput. Sci., 2004

2003

Residual Finite Tree Automata.

Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Iterated relabeling tree transducers.

Zoltán Fülöp, Alain Terlutte

Theor. Comput. Sci., 2002

Residual Finite State Automata.

François Denis, Aurélien Lemay, Alain Terlutte

Fundam. Informaticae, 2002

Some Classes of Regular Languages Identifiable in the Limit from Positive Data.

François Denis, Aurélien Lemay, Alain Terlutte

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001

Learning Regular Languages Using RFSA.

François Denis, Aurélien Lemay, Alain Terlutte

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Iteration of rational transductions.

Alain Terlutte, David Simplot

RAIRO Theor. Informatics Appl., 2000

Closure under union and composition of iterated rational transductions.

David Simplot, Alain Terlutte

RAIRO Theor. Informatics Appl., 2000

Learning Regular Languages Using Non Deterministic Finite Automata.

François Denis, Aurélien Lemay, Alain Terlutte

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1998

Iterated Length-Preserving Rational Transductions.

Michel Latteux, David Simplot, Alain Terlutte

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1996

On Computational Power of Weighted Finite Automata.

Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte

Fundam. Informaticae, 1996

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 Continuous Functions Computed by Finite Automata.

Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte

RAIRO Theor. Informatics Appl., 1994

1993

Compositions of Codings.

Denis Derencourt, Alain Terlutte

Proceedings of the Developments in Language Theory, 1993

1990

Cyclic Rational Transductions and Polynomials of Rational Functions.

Alain Terlutte

Theor. Comput. Sci., 1990

1987

Sur Les Centres De Dol-Languages.

Alain Terlutte

RAIRO Theor. Informatics Appl., 1987