The Todd-Coxeter Algorithm for Semigroups and Monoids
arXiv:2203.11148
Abstract
In this paper we provide an account of the Todd-Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd-Coxeter algorithm for groups.
42 pages, 16 figures, 11 tables, updated according to referee's comments, to appear in Semigroup Forum