Regularity on near permutation semigroups

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)2803-2826
Number of pages24
JournalCommunications in Algebra
Volume32
Issue number7
DOIs
Publication statusPublished - 1 Jan 2004

Keywords

  • Near permutation semigroups
  • Regular semigroups
  • Transformation semigroups

Fingerprint Dive into the research topics of 'Regularity on near permutation semigroups'. Together they form a unique fingerprint.

Cite this