Computing congruences of finite inverse semigroups

In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups. An initial implementation of this algorithm outperforms existing implementations by several orders of magnitude.