The Todd-Coxeter Algorithm for Semigroups and Monoids
T. D. H. Coleman, J. D. Mitchell, F. L. Smith, and M. Tsalakou
TL;DR
This paper adapts the Todd-Coxeter algorithm to semigroups and monoids, providing a new description of the Felsch strategy analogue for semigroups, enhancing computational methods in algebra.
Contribution
It introduces a novel adaptation of the Todd-Coxeter algorithm for semigroups and monoids, including a new description of the Felsch strategy for these structures.
Findings
Provides an algorithm for computing congruences on semigroups and monoids.
Introduces a new perspective on the Felsch strategy for semigroups.
Enhances computational tools for algebraic structures.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Advanced Algebra and Logic