On the determination of Green's relations in finite transformation semigroups

DOI10.1016/S0747-7171(08)80057-0zbMath0792.20061OpenAlexW2130835224MaRDI QIDQ1173774

Gerard Lallement, Robert B. McFadden

Publication date: 25 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80057-0

zbMATH Keywords

algorithmmaximal subgroupsgeneratorsalgorithmic complexitytransformation semigroupGreen's equivalence relations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)

Related Items (4)

Gérard Lallement (1935-2006) ⋮ Computing finite semigroups ⋮ Computing transformation semigroups ⋮ Green's equivalences in finite semigroups of binary relations

Cites Work

• Computing the ideal structure of finite semigroups
• Computers in semigroups
• The Number of Partitions of a Set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the determination of Green's relations in finite transformation semigroups