Gerard Lallement

According to our database, Gerard Lallement authored at least 7 papers between 1971 and 1993.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1993

The Word Problem for Thue Rewriting Systems.

Gerard Lallement

Proceedings of the Term Rewriting, 1993

1990

On the Determination of Green's Relations in Finite Tranformation Semigroups.

Gerard Lallement, R. McFadden

J. Symb. Comput., 1990

1981

Team Tournaments and Finite Elementary Codes

Gerard Lallement, C. Reis

Inf. Control., January, 1981

A graph covering construction of all the finite complete biprefix codes.

Gerard Lallement, Dominique Perrin

Discret. Math., 1981

1978

Cyclotomic polynomials and unions of groups.

Gerard Lallement

Discret. Math., 1978

1976

Regular Semigroups with <i> D = R </i> as Syntactic Monoids of Prefix Codes.

Gerard Lallement

Theor. Comput. Sci., 1976

1971

On the Prime Decomposition Theorem for Finite Monoids.

Gerard Lallement

Math. Syst. Theory, 1971