The Todd–Coxeter algorithm for semigroups and monoids
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.
Citation
Coleman , T , Mitchell , J D , Tsalakou , M & Smith , F L 2024 , ' The Todd–Coxeter algorithm for semigroups and monoids ' , Semigroup Forum . https://doi.org/10.1007/s00233-024-10431-z
Publication
Semigroup Forum
Status
Peer reviewed
ISSN
0037-1912Type
Journal article
Description
The third author was supported by the EPSRC doctoral training partnership number EP/N509759/1 when working on this project. The fourth author would like to thank the School of Mathematics and Statistics of the University of St Andrews and the Cyprus State Scholarship Foundation for their financial support.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.