2019/05/27 by Rita Caneco, Vítor H. Fernandes, Caneco, Rita +3
Computer Science · #semigroups and automata theory #Advanced Algebra and Logic #Natural Language Processing Techniques
paper · pdf · doi:10.48550/arxiv.1905.11489
In this paper we compute the rank and exhibit a presentation for the monoids of all P-stable and P-order preserving partial permutations on a finite set Ω, with P an ordered uniform partition of Ω. These (inverse) semigroups constitute a natural class of generators of the pseudovariety of inverse semigroups \sf NO of all normally ordered (finite) inverse semigroups.