Use this URL to cite or link to this record in EThOS:
Title: Todd-Coxeter methods for inverse monoids
Author: Cutting, Andrew
Awarding Body: University of St Andrews
Current Institution: University of St Andrews
Date of Award: 2001
Availability of Full Text:
Access from EThOS:
Access from Institution:
Let 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 Ru 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 Ru = Rv, 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.
Supervisor: Robertson, E. F. ; Atkinson, M. D. Sponsor: Engineering and Physical Sciences Research Council (EPSRC)
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA171.M7C9