Show simple item record

Files in this item


Item metadata

dc.contributor.advisorRobertson, E. F.
dc.contributor.advisorAtkinson, M.D.
dc.contributor.authorCutting, Andrew
dc.coverage.spatial161 p.en_US
dc.description.abstractLet P be the inverse monoid presentation (X|U) for the inverse monoid M, let π be the set of generators for a right congruence on M and let u Є M. Using the work of J. Stephen [15], the current work demonstrates a coset enumeration technique for the R-class Rᵤ similar to the coset enumeration algorithm developed by J. A. Todd and H. S. M. Coxeter for groups. Furthermore it is demonstrated how to test whether Rᵤ = Rᵥ, for u, v Є M and so a technique for enumerating inverse monoids is described. This technique is generalised to enumerate the H-classes of M. The algorithms have been implemented in GAP 3.4.4 [25], and have been used to analyse some examples given in Chapter 6. The thesis concludes by a related discussion of normal forms and automaticity of free inverse semigroups.en_US
dc.publisherUniversity of St Andrewsen
dc.titleTodd-Coxeter methods for inverse monoidsen_US
dc.contributor.sponsorEngineering and Physical Sciences Research Council (EPSRC)en_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US

This item appears in the following Collection(s)

Show simple item record