The Todd-Coxeter algorithm for semigroups and monoids
From MaRDI portal
Recommendations
Cites work
- A practical method for enumerating cosets of a finite abstract group
- A presentation for the monoid of uniform block permutations
- A PRESENTATION OF THE DUAL SYMMETRIC INVERSE MONOID
- Algorithms for computing finite semigroups
- Constructing matrix representations of finitely presented groups
- Coset Enumeration in a Finitely Presented Semigroup
- DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS
- Efficiency of a Good But Not Linear Set Union Algorithm
- Generators and relations for partition monoids and algebras.
- scientific article; zbMATH DE number 3769860 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3191321 (Why is no real title available?)
- Implementation and Analysis of the Todd-Coxeter Algorithm
- On semigroup presentations
- On vector enumeration
- Presentation of the singular part of the Brauer monoid
- Presentations for Temperley-Lieb algebras
- Presentations for two extensions of the monoid of order-preserving mappings on a finite chain
- Presentations of inverse monoids
- Semigroup and Group Presentations
- Some Remarks on Semigroup Presentations
- The 0-rook monoid and its representation theory
- The stylic monoid
- THE WORD PROBLEM
- Über unendliche diskontinuierliche Gruppen.
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 Q6582344)