Combinaisons d'automates et de boules de mots pour la classification de séquences.

Alain Terlutte

Frédéric Tantini Alain Terlutte Fabien Torre Combinaisons d'automates et de boules de mots pour la classification de séquences. 411-434 2011 25 Rev. d'Intelligence Artif. 3 https://doi.org/10.3166/ria.25.411-434 db/journals/ria/ria25.html#TantiniTT11

Frédéric Tantini Alain Terlutte Fabien Torre Sequences Classification by Least General Generalisations. 189-202 2010 ICGI https://doi.org/10.1007/978-3-642-15488-1_16 conf/icgi/2010 db/conf/icgi/icgi2010.html#TantiniTT10

Michel Latteux Yves Roos Alain Terlutte Minimal NFA and biRFSA Languages. 221-237 2009 43 RAIRO Theor. Informatics Appl. 2 https://doi.org/10.1051/ita:2008022 db/journals/ita/ita43.html#LatteuxRT09

Michel Latteux Aurélien Lemay Yves Roos Alain Terlutte Identification of biRFSA languages. 212-223 2006 356 Theor. Comput. Sci. 1-2 https://doi.org/10.1016/j.tcs.2006.01.029 db/journals/tcs/tcs356.html#LatteuxLRT06

Julien Carme Rémi Gilleron Aurélien Lemay Alain Terlutte Marc Tommasi Residual Finite Tree Automata http://arxiv.org/abs/cs/0609015 2006 CoRR abs/cs/0609015 db/journals/corr/corr0609.html#abs-cs-0609015

François Denis Aurélien Lemay Alain Terlutte Learning regular languages using RFSAs. 267-294 2004 313 Theor. Comput. Sci. 2 https://doi.org/10.1016/j.tcs.2003.11.008 db/journals/tcs/tcs313.html#DenisLT04

Julien Carme Rémi Gilleron Aurélien Lemay Alain Terlutte Marc Tommasi Residual Finite Tree Automata. 171-182 2003 conf/dlt/2003 Developments in Language Theory https://doi.org/10.1007/3-540-45007-6_13 db/conf/dlt/dlt2003.html#CarmeGLTT03

François Denis Aurélien Lemay Alain Terlutte Residual Finite State Automata. 339-368 2002 51 Fundam. Informaticae 4 http://content.iospress.com/articles/fundamenta-informaticae/fi51-4-02 db/journals/fuin/fuin51.html#DenisLT02

Zoltán Fülöp 0001 Alain Terlutte Iterated relabeling tree transducers. 221-244 2002 276 Theor. Comput. Sci. 1-2 db/journals/tcs/tcs276.html#FulopT02 https://doi.org/10.1016/S0304-3975(01)00181-5

François Denis Aurélien Lemay Alain Terlutte Some Classes of Regular Languages Identifiable in the Limit from Positive Data. 63-76 2002 conf/icgi/2002 ICGI https://doi.org/10.1007/3-540-45790-9_6 db/conf/icgi/icgi2002.html#DenisLT02 François Denis Aurélien Lemay Alain Terlutte Learning Regular Languages Using RFSA. 348-363 2001 conf/alt/2001 ALT https://doi.org/10.1007/3-540-45583-3_26 db/conf/alt/alt2001.html#DenisLT01 François Denis Aurélien Lemay Alain Terlutte Residual Finite State Automata. 144-157 2001 conf/stacs/2001 STACS https://doi.org/10.1007/3-540-44693-1_13 db/conf/stacs/stacs2001.html#DenisLT01

Alain Terlutte David Simplot Iteration of rational transductions. 99-130 2000 34 RAIRO Theor. Informatics Appl. 2 db/journals/ita/ita34.html#TerlutteS00 https://doi.org/10.1051/ita:2000109

David Simplot Alain Terlutte Closure under union and composition of iterated rational transductions. 183-212 2000 34 RAIRO Theor. Informatics Appl. 3 db/journals/ita/ita34.html#SimplotT00 https://doi.org/10.1051/ita:2000114

François Denis Aurélien Lemay Alain Terlutte Learning Regular Languages Using Non Deterministic Finite Automata. 39-50 2000 conf/icgi/2000 ICGI db/conf/icgi/icgi2000.html#DenisLT00 https://doi.org/10.1007/978-3-540-45257-7_4 Michel Latteux David Simplot Alain Terlutte Iterated Length-Preserving Rational Transductions. 286-295 1998 conf/mfcs/1998 MFCS https://doi.org/10.1007/BFb0055778 db/conf/mfcs/mfcs98.html#LatteuxST98

Denis Derencourt Juhani Karhumäki Michel Latteux Alain Terlutte On Computational Power of Weighted Finite Automata. 285-293 1996 25 Fundam. Informaticae 3 db/journals/fuin/fuin25.html#DerencourtKLT96 https://doi.org/10.3233/FI-1996-253406

Denis Derencourt Juhani Karhumäki Michel Latteux Alain Terlutte On Continuous Functions Computed by Finite Automata. 387-403 1994 28 RAIRO Theor. Informatics Appl. 3-4 db/journals/ita/ita28.html#DerencourtKLT94 https://doi.org/10.1051/ita/1994283-403871

Tero Harju H. C. M. Kleijn Michel Latteux Alain Terlutte Representation of Rational Functions with Prefix and Suffix Codings. 403-413 1994 134 Theor. Comput. Sci. 2 db/journals/tcs/tcs134.html#HarjuKLT94 https://doi.org/10.1016/0304-3975(94)90245-3

Denis Derencourt Alain Terlutte Compositions of Codings. 30-43 1993 conf/dlt/1993 Developments in Language Theory db/conf/dlt/dlt1993.html#DerencourtT93 Denis Derencourt Juhani Karhumäki Michel Latteux Alain Terlutte On Computational Power of Weighted Finite Automata. 236-245 1992 conf/mfcs/1992 MFCS db/conf/mfcs/mfcs92.html#DerencourtKLT92 https://doi.org/10.1007/3-540-55808-X_22

Alain Terlutte Cyclic Rational Transductions and Polynomials of Rational Functions. 261-271 1990 70 Theor. Comput. Sci. 2 db/journals/tcs/tcs70.html#Terlutte90 https://doi.org/10.1016/0304-3975(90)90126-3

Alain Terlutte Cyclic Rational Transductions and Polynomials of Rational Functions. 149-158 1988 conf/stacs/1988 STACS db/conf/stacs/stacs88.html#Terlutte88 https://doi.org/10.1007/BFb0035841

Alain Terlutte Sur Les Centres De Dol-Languages. 137-145 1987 21 RAIRO Theor. Informatics Appl. 2 db/journals/ita/ita21.html#Terlutte87 https://doi.org/10.1051/ita/1987210201371

Julien Carme François Denis Denis Derencourt Zoltán Fülöp 0001 Rémi Gilleron Tero Harju Juhani Karhumäki Jetty KleijnH. C. M. Kleijn Michel Latteux Aurélien Lemay Yves Roos David Simplot-RylDavid Simplot Frédéric Tantini Marc Tommasi Fabien Torre