×

zbMATH — the first resource for mathematics

Terlutte, Alain

Compute Distance To:
Author ID: terlutte.alain Recent zbMATH articles by "Terlutte, Alain"
Published as: Terlutte, A.; Terlutte, Alain
Documents Indexed: 20 Publications since 1986

Publications by Year

Citations contained in zbMATH

15 Publications have been cited 61 times in 41 Documents Cited by Year
Residual finite state automata. Zbl 1011.68048
Denis, François; Lemay, Aurélien; Terlutte, Alain
10
2002
Learning regular languages using RFSAs. Zbl 1059.68058
Denis, François; Lemay, Aurélien; Terlutte, Alain
8
2004
Learning regular languages using non deterministic finite automata. Zbl 0974.68088
Denis, François; Lemay, Aurélien; Terlutte, Alain
7
2000
Iteration of rational transductions. Zbl 0962.68090
Terlutte, Alain; Simplot, David
7
2000
Some classes of regular languages identifiable in the limit from positive data. Zbl 1028.68112
Denis, François; Lemay, Aurélien; Terlutte, Alain
4
2002
Residual finite state automata. Zbl 0976.68089
Denis, François; Lemay, Aurélien; Terlutte, Alain
4
2001
On continuous functions computed by finite automata. Zbl 0883.68095
Derencourt, D.; Karhumäki, J.; Latteux, M.; Terlutte, A.
4
1994
Minimal NFA and biRFSA languages. Zbl 1166.68025
Latteux, Michel; Roos, Yves; Terlutte, Alain
3
2009
Learning regular languages using RFSA. Zbl 1050.68058
Denis, François; Lemay, Aurélien; Terlutte, Alain
3
2001
Closure under union and composition of iterated rational transductions. Zbl 0970.68085
Simplot, D.; Terlutte, A.
3
2000
Identification of birfsa languages. Zbl 1160.68417
Latteux, Michel; Lemay, Aurélien; Roos, Yves; Terlutte, Alain
2
2006
Residual finite tree automata. Zbl 1037.68076
Carme, Julien; Gilleron, Rémi; Lemay, Aurélien; Terlutte, Alain; Tommasi, Marc
2
2003
On computational power of weighted finite automata. Zbl 0843.68073
Derencourt, D.; Karhumäki, J.; Latteux, M.; Terlutte, A.
2
1996
Iterated relabeling tree transducers. Zbl 1002.68077
Fülöp, Z.; Terlutte, A.
1
2002
Sur les centres de D0L-languages. (On the centers of D0L-languages). Zbl 0634.68071
Terlutte, A.
1
1987
Minimal NFA and biRFSA languages. Zbl 1166.68025
Latteux, Michel; Roos, Yves; Terlutte, Alain
3
2009
Identification of birfsa languages. Zbl 1160.68417
Latteux, Michel; Lemay, Aurélien; Roos, Yves; Terlutte, Alain
2
2006
Learning regular languages using RFSAs. Zbl 1059.68058
Denis, François; Lemay, Aurélien; Terlutte, Alain
8
2004
Residual finite tree automata. Zbl 1037.68076
Carme, Julien; Gilleron, Rémi; Lemay, Aurélien; Terlutte, Alain; Tommasi, Marc
2
2003
Residual finite state automata. Zbl 1011.68048
Denis, François; Lemay, Aurélien; Terlutte, Alain
10
2002
Some classes of regular languages identifiable in the limit from positive data. Zbl 1028.68112
Denis, François; Lemay, Aurélien; Terlutte, Alain
4
2002
Iterated relabeling tree transducers. Zbl 1002.68077
Fülöp, Z.; Terlutte, A.
1
2002
Residual finite state automata. Zbl 0976.68089
Denis, François; Lemay, Aurélien; Terlutte, Alain
4
2001
Learning regular languages using RFSA. Zbl 1050.68058
Denis, François; Lemay, Aurélien; Terlutte, Alain
3
2001
Learning regular languages using non deterministic finite automata. Zbl 0974.68088
Denis, François; Lemay, Aurélien; Terlutte, Alain
7
2000
Iteration of rational transductions. Zbl 0962.68090
Terlutte, Alain; Simplot, David
7
2000
Closure under union and composition of iterated rational transductions. Zbl 0970.68085
Simplot, D.; Terlutte, A.
3
2000
On computational power of weighted finite automata. Zbl 0843.68073
Derencourt, D.; Karhumäki, J.; Latteux, M.; Terlutte, A.
2
1996
On continuous functions computed by finite automata. Zbl 0883.68095
Derencourt, D.; Karhumäki, J.; Latteux, M.; Terlutte, A.
4
1994
Sur les centres de D0L-languages. (On the centers of D0L-languages). Zbl 0634.68071
Terlutte, A.
1
1987

Citations by Year