Todd-Coxeter methods for inverse monoids
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 algori...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of St Andrews
2001
|
| Subjects: | |
| Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.750297 |