The classification of finite congruence-free semigroups with zero
Ren Xiu · Journal of Hangzhou Teachers College · 2004
In this paper, we introduce two definitions which are both 0, 1 regular matrix and type C matrix-pair, and give ample and essential condition on isomorphism of finite congruence-free semigroups with zero. That is 0,1 regular matrices, by which a binary operation is defined on finite congruence-free semigroups with zero,can translate one another by the first kind of elementary operation. As a result, classification of finite congruence-free semigroups with zero is greatly simplified.