INVERSE SEMIGROUPS OF PARTIAL AUTOMATON PERMUTATIONS
Andriy Oliynyk, Vitaly I. Sushchansky, Janusz Słupik · International Journal of Algebra and Computation · 2010
The inverse semigroup of partial automaton permutations over a finite alphabet is characterized in terms of wreath products. The permutation conjugacy relation in this semigroup and the Green's relations are described. Criteria of primary conjugacy and conjugacy are given for certain naturally defined families of partial automaton permutations. Sufficient conditions under which an inverse semigroup admits a level transitive action are presented. We give explicit examples (monogenic inverse semigroups and some commutative Clifford semigroups) of inverse semigroups generated by finite automata.