On the Prime Decomposition Theorem for Finite Monoids. - Gerard Lallement (Math. Syst. Theory, 1971)

Regular Semigroups with D = R as Syntactic Monoids of Prefix Codes. - Gerard Lallement (Theor. Comput. Sci., 1976)

Cyclotomic polynomials and unions of groups. - Gerard Lallement (Discret. Math., 1978)

A graph covering construction of all the finite complete biprefix codes. - Gerard Lallement; Dominique Perrin (Discret. Math., 1981)

Team Tournaments and Finite Elementary Codes - Gerard Lallement; C. Reis (Inf. Control., 1981)

On the Determination of Green's Relations in Finite Tranformation Semigroups. - Gerard Lallement; R. McFadden (J. Symb. Comput., 1990)

The Word Problem for Thue Rewriting Systems. - Gerard Lallement (Term Rewriting, 1993)