The Todd-Coxeter Algorithm for Semigroups and Monoids

2022/03/21 by Coleman, T. D. H., Mitchell, J. D., Smith, F. L. +1 · 1 citation
#20M05 #20M30 #FOS: Mathematics #Group Theory (math.GR) #Rings and Algebras (math.RA)

paper · doi:10.48550/arxiv.2203.11148

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.

Cited by

• Introducing GRAFHEN: Group-based Fully Homomorphic Encryption without Noise

Related

• The conjugacy problem in semigroups and monoids
• Computing finite index congruences of finitely presented semigroups and monoids
• Computing congruences of finite inverse semigroups
• Master List of Examples in Complexity Theory of Finite Semigroup Theory
• Two variants of the Froiduire-Pin Algorithm for finite semigroups