The Todd-Coxeter Algorithm for Semigroups and Monoids
From MaRDI portal
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.
This page was built for publication: The Todd-Coxeter Algorithm for Semigroups and Monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505628)