Compositions of Codings. - Denis Derencourt; Alain Terlutte (Developments in Language Theory, 1993)

On Continuous Functions Computed by Finite Automata. - Denis Derencourt; Juhani Karhumäki; Michel Latteux; Alain Terlutte (RAIRO Theor. Informatics Appl., 1994)

On Computational Power of Weighted Finite Automata. - Denis Derencourt; Juhani Karhumäki; Michel Latteux; Alain Terlutte (Fundam. Informaticae, 1996)

A Three-Word Code Which is Not Prefix-Suffix Composed. - Denis Derencourt (Theor. Comput. Sci., 1996)

The Meet Operation in the Lattice of Codes. - Véronique Bruyère; Denis Derencourt; Michel Latteux (Theor. Comput. Sci., 1998)