Alain Terlutte

2006
21	EE	Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata CoRR abs/cs/0609015: (2006)
20	EE	Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte: Identification of biRFSA languages. Theor. Comput. Sci. 356(1-2): 212-223 (2006)
2004
19	EE	François Denis, Aurélien Lemay, Alain Terlutte: Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004)
2003
18	EE	Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182
2002
17	EE	François Denis, Aurélien Lemay, Alain Terlutte: Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI 2002: 63-76
16	EE	François Denis, Aurélien Lemay, Alain Terlutte: Residual Finite State Automata. Fundam. Inform. 51(4): 339-368 (2002)
15	EE	Zoltán Fülöp, Alain Terlutte: Iterated relabeling tree transducers. Theor. Comput. Sci. 276(1-2): 221-244 (2002)
2001
14	EE	François Denis, Aurélien Lemay, Alain Terlutte: Learning Regular Languages Using RFSA. ALT 2001: 348-363
13	EE	François Denis, Aurélien Lemay, Alain Terlutte: Residual Finite State Automata. STACS 2001: 144-157
2000
12		François Denis, Aurélien Lemay, Alain Terlutte: Learning Regular Languages Using Non Deterministic Finite Automata. ICGI 2000: 39-50
11		Alain Terlutte, David Simplot: Iteration of rational transductions. ITA 34(2): 99-130 (2000)
10		David Simplot, Alain Terlutte: Closure under union and composition of iterated rational transductions. ITA 34(3): 183-212 (2000)
1998
9	EE	Michel Latteux, David Simplot, Alain Terlutte: Iterated Length-Preserving Rational Transductions. MFCS 1998: 286-295
1996
8		Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte: On Computational Power of Weighted Finite Automata. Fundam. Inform. 25(3): 285-293 (1996)
1994
7		Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte: On Continuous Functions Computed by Finite Automata. ITA 28(3-4): 387-403 (1994)
6		Tero Harju, H. C. M. Kleijn, Michel Latteux, Alain Terlutte: Representation of Rational Functions with Prefix and Suffix Codings. Theor. Comput. Sci. 134(2): 403-413 (1994)
1993
5		Denis Derencourt, Alain Terlutte: Compositions of Codings. Developments in Language Theory 1993: 30-43
1992
4		Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte: On Computational Power of Weighted Finite Automata. MFCS 1992: 236-245
1990
3		Alain Terlutte: Cyclic Rational Transductions and Polynomials of Rational Functions. Theor. Comput. Sci. 70(2): 261-271 (1990)
1988
2		Alain Terlutte: Cyclic Rational Transductions and Polynomials of Rational Functions. STACS 1988: 149-158
1987
1		Alain Terlutte: Sur Les Centres De Dol-Languages. ITA 21(2): 137-145 (1987)

Coauthor Index

1	Julien Carme	[18] [21]
2	François Denis	[12] [13] [14] [16] [17] [19]
3	Denis Derencourt	[4] [5] [7] [8]
4	Zoltán Fülöp	[15]
5	Rémi Gilleron	[18] [21]
6	Tero Harju	[6]
7	Juhani Karhumäki	[4] [7] [8]
8	Jetty Kleijn (H. C. M. Kleijn)	[6]
9	Michel Latteux	[4] [6] [7] [8] [9] [20]
10	Aurélien Lemay	[12] [13] [14] [16] [17] [18] [19] [20] [21]
11	Yves Roos	[20]
12	David Simplot-Ryl (David Simplot)	[9] [10] [11]
13	Marc Tommasi	[18] [21]

Colors in the list of coauthors