首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Regularity on Near Permutation Semigroups
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.
Keywords:Transformation semigroups  Near permutation semigroups  Regular semigroups
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号