A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Coset enumeration in a finitely presented semigroup

1978
*
Canadian mathematical bulletin
*

1. Introduction. The enumeration method for finite groups, the so-called Todd-Coxeter process, has been described in [2] , [3] . Leech [4] and Trotter [5] carried out the process of coset enumeration for groups on a computer. However Mendelsohn [1] was the first to present a formal proof of the fact that this process ends after a finite number of steps and that it actually enumerates cosets in a group. Dietze and Schaps [7] used Todd-Coxeter's method to find all subgroups of a given finite

doi:10.4153/cmb-1978-007-x
fatcat:f32we4qqwjhifjh3j4v3ol2xru