| |
| 1993 | ||
|---|---|---|
| 6 | Gerard Lallement: The Word Problem for Thue Rewriting Systems. Term Rewriting 1993: 27-38 | |
| 1990 | ||
| 5 | Gerard Lallement, R. McFadden: On the Determination of Green's Relations in Finite Tranformation Semigroups. J. Symb. Comput. 10(5): 481-498 (1990) | |
| 1981 | ||
| 4 | EE | Gerard Lallement, Dominique Perrin: A graph covering construction of all the finite complete biprefix codes. Discrete Mathematics 36(3): 261-271 (1981) |
| 3 | Gerard Lallement, C. Reis: Team Tournaments and Finite Elementary Codes Information and Control 48(1): 11-29 (1981) | |
| 1976 | ||
| 2 | Gerard Lallement: Regular Semigroups with D = R as Syntactic Monoids of Prefix Codes. Theor. Comput. Sci. 3(1): 35-49 (1976) | |
| 1971 | ||
| 1 | Gerard Lallement: On the Prime Decomposition Theorem for Finite Monoids. Mathematical Systems Theory 5(1): 8-12 (1971) | |
| 1 | R. McFadden | [5] |
| 2 | Dominique Perrin | [4] |
| 3 | C. Reis | [3] |