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 computational group theory, automata, and the theory of inverse semigroups. An initial implementation of this algorithm outperforms existing implementations by several orders of magnitude.

翻译：本文提出了一种新颖算法，用于根据生成对集合计算逆半群上的同余关系。该算法综合运用了计算群论、自动机理论和逆半群理论中的多种技术。该算法的初步实现性能较现有实现提升了数个数量级。