Computing Transformation Semigroups

This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of a group and an action. They provide for local computations, concerning a single R-class, without computing the whole semigroup, as well as for computing the global structure of the semigroup. The algorithms have been implemented in the share package MONOID within the GAP system for computational algebra.

• Type: Journal
• Year: 2002
• Where: JSC
• Authors: Steve Linton, G. Pfeiffer, Edmund F. Robertson, Nikola Ruskuc
• Keywords: Algorithms, JSC 2002, Semigroup, Transformation Semigroups