Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorColeman, Tom
dc.contributor.authorMitchell, James David
dc.contributor.authorTsalakou, Maria
dc.contributor.authorSmith, Finlay Laughlan
dc.date.accessioned2024-05-08T12:31:23Z
dc.date.available2024-05-08T12:31:23Z
dc.date.issued2024-05-03
dc.identifier298247570
dc.identifierb8cb360e-2e2d-4193-822f-32e7257fd6c7
dc.identifier85191981828
dc.identifier.citationColeman , T , Mitchell , J D , Tsalakou , M & Smith , F L 2024 , ' The Todd–Coxeter algorithm for semigroups and monoids ' , Semigroup Forum . https://doi.org/10.1007/s00233-024-10431-zen
dc.identifier.issn0037-1912
dc.identifier.otherORCID: /0000-0003-2012-4919/work/159432850
dc.identifier.urihttps://hdl.handle.net/10023/29831
dc.descriptionThe third author was supported by the EPSRC doctoral training partnership number EP/N509759/1 when working on this project. The fourth author would like to thank the School of Mathematics and Statistics of the University of St Andrews and the Cyprus State Scholarship Foundation for their financial support.en
dc.description.abstractIn 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.
dc.format.extent1240839
dc.language.isoeng
dc.relation.ispartofSemigroup Forumen
dc.subjectT-NDASen
dc.titleThe Todd–Coxeter algorithm for semigroups and monoidsen
dc.typeJournal articleen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Applied Mathematicsen
dc.identifier.doi10.1007/s00233-024-10431-z
dc.description.statusPeer revieweden
dc.identifier.urlhttps://arxiv.org/abs/2203.11148en


This item appears in the following Collection(s)

Show simple item record