The Todd-Coxeter algorithm for semigroups and monoids
From MaRDI portal
Publication:6582344
DOI10.1007/S00233-024-10431-ZMaRDI QIDQ6582344
Thomas D. H. Coleman, F. L. Smith, Maria Tsalakou, J. D. Mitchell
Publication date: 2 August 2024
Published in: Semigroup Forum (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Presentations of inverse monoids
- Generators and relations for partition monoids and algebras.
- Constructing matrix representations of finitely presented groups
- On vector enumeration
- Über unendliche diskontinuierliche Gruppen.
- Presentations for two extensions of the monoid of order-preserving mappings on a finite chain
- The 0-rook monoid and its representation theory
- The stylic monoid
- THE WORD PROBLEM
- A PRESENTATION OF THE DUAL SYMMETRIC INVERSE MONOID
- Presentation of the singular part of the Brauer monoid
- DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS
- Efficiency of a Good But Not Linear Set Union Algorithm
- Implementation and Analysis of the Todd-Coxeter Algorithm
- Coset Enumeration in a Finitely Presented Semigroup
- On semigroup presentations
- Algorithms for computing finite semigroups
- A presentation for the monoid of uniform block permutations
- Semigroup and Group Presentations
- Presentations for Temperley–Lieb Algebras
- Some Remarks on Semigroup Presentations
- A practical method for enumerating cosets of a finite abstract group
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)
