The Todd-Coxeter Algorithm for Semigroups and Monoids

03/21/2022

∙

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.

READ FULL TEXT

The Todd-Coxeter Algorithm for Semigroups and Monoids

A Reply to "On Salum's Algorithm for X3SAT"

On the functional graph of the power map over finite groups

Determining satisfiability of 3-SAT in polynomial time

An Example of the SAM+ Algorithm for Learning Action Models for Stochastic Worlds

A simple introduction to Karmarkar's Algorithm for Linear Programming

TiK-means: K-means clustering for skewed groups

Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs

The Todd-Coxeter Algorithm for Semigroups and Monoids

Related Research

A Reply to "On Salum's Algorithm for X3SAT"

On the functional graph of the power map over finite groups

Determining satisfiability of 3-SAT in polynomial time

An Example of the SAM+ Algorithm for Learning Action Models for Stochastic Worlds

A simple introduction to Karmarkar's Algorithm for Linear Programming

TiK-means: K-means clustering for skewed groups

Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs