The Todd-Coxeter Algorithm for Semigroups and Monoids

The Todd-Coxeter Algorithm for Semigroups and Monoids

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-03
Hauptverfasser: Coleman, T D H, Mitchell, J D, Smith, F L, Tsalakou, M
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Congruences
Monoids
Semigroups
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422