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.
No takes yet. Share an insight, caveat, or question.
Coleman et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: