Bibliography

[CMST22]

T. D. H. Coleman, J. D. Mitchell, F. L. Smith, and M. Tsalakou. The todd-coxeter algorithm for semigroups and monoids. 2022. arXiv:arXiv:2203.11148.

[FP97]

Véronique Froidure and Jean-Eric Pin. Algorithms for computing finite semigroups. In Foundations of computational mathematics (Rio de Janeiro, 1997), pages 112–126. Springer, Berlin, 1997.

[Gil79]

Robert H Gilman. Presentations of groups and monoids. Journal of Algebra, 57(2):544–554, April 1979.

[HR99]

George Havas and Colin Ramsay. Coset enumeration: ACE. PhD thesis, University of Queensland, 1999.

[Hol19]

Derek Holt. Kbmag – GAP package, Version 1.5.9. July 2019. URL: https://gap-packages.github.io/kbmag/.

[Jan12]

Matthias Jantzen. Confluent string rewriting. Volume 14. Springer Science & Business Media, 2012.

[JMP17]

Julius Jonusas, James D. Mitchell, and Markus Pfeiffer. Two variants of the Froidure-Pin algorithm for finite semigroups. Port. Math., 74(3):173–200, 2017. URL: https://doi.org/10.4171/PM/2001, doi:10.4171/PM/2001.

[Kam09a]

Mark Kambites. Small overlap monoids. II. Automatic structures and normal forms. J. Algebra, 321(8):2302–2316, 2009. URL: http://dx.doi.org/10.1016/j.jalgebra.2008.12.028, doi:10.1016/j.jalgebra.2008.12.028.

[Kam09b]

Mark Kambites. Small overlap monoids. I. The word problem. J. Algebra, 321(8):2187–2205, 2009. URL: http://dx.doi.org/10.1016/j.jalgebra.2008.09.038, doi:10.1016/j.jalgebra.2008.09.038.

[Knu09]

Donald E. Knuth. The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. Addison-Wesley Professional, 12th edition, 2009. ISBN 0321580508, 9780321580504.

[Kon94]

Janusz Konieczny. Green's equivalences in finite semigroups of binary relations. Semigroup Forum, 48(2):235–252, 1994. doi:10.1007/BF02573672.

[LM90]

Gerard Lallement and Robert McFadden. On the determination of Green's relations in finite transformation semigroups. J. Symbolic Comput., 10(5):481–498, 1990. doi:10.1016/S0747-7171(08)80057-0.

[MM13]

Paul Martin and Volodymyr Mazorchuk. Partitioned binary relations. Mathematica Scandinavica, 113(1):30–52, 2013. URL: http://www.jstor.org/stable/24493105.

[MT21]

J. D. Mitchell and M. Tsalakou. An explicit algorithm for normal forms in small overlap monoids. preprint, 2021.

[RR10]

J. Radoszewski and W. Rytter. Efficient testing of equivalence of words in a free idempotent semigroup. In SOFSEM 2010: Theory and Practice of Computer Science, 663–671. 01 2010. doi:10.1007/978-3-642-11266-9_55.

[Sim94]

Charles C. Sims. Computation with finitely presented groups. Encyclopedia of mathematics and its applications. Cambridge University Press, Cambridge„ England, New York, 1994. ISBN 0-521-43213-8. URL: http://opac.inria.fr/record=b1082972.