1998 |
6 | EE | Véronique Bruyère,
Denis Derencourt,
Michel Latteux:
The Meet Operation in the Lattice of Codes.
Theor. Comput. Sci. 191(1-2): 117-129 (1998) |
1996 |
5 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Computational Power of Weighted Finite Automata.
Fundam. Inform. 25(3): 285-293 (1996) |
4 | EE | Denis Derencourt:
A Three-Word Code Which is Not Prefix-Suffix Composed.
Theor. Comput. Sci. 163(1&2): 145-160 (1996) |
1994 |
3 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Continuous Functions Computed by Finite Automata.
ITA 28(3-4): 387-403 (1994) |
1993 |
2 | | Denis Derencourt,
Alain Terlutte:
Compositions of Codings.
Developments in Language Theory 1993: 30-43 |
1992 |
1 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Computational Power of Weighted Finite Automata.
MFCS 1992: 236-245 |