Abstract: | Abstract A transformation semigroup over a set X with N elements is said to be a near permutation semigroup if it is generated by a group of permutations on N elements and by a set of transformations of rank N ? 1. The aim of this paper is to determine computationally efficient conditions to test whether or not a near permutation semigroup is regular. |