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.
| Original language | English |
|---|---|
| Pages (from-to) | 2803-2826 |
| Number of pages | 24 |
| Journal | Communications in Algebra |
| Volume | 32 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 1 Jan 2004 |
Keywords
- Near permutation semigroups
- Regular semigroups
- Transformation semigroups