The inverse semigroup of partial automaton permutations over a finite alphabet is
characterized in terms of wreath products. The permutation conjugacy relation in this …

In this dissertation we classify the metabelian groups arising from a restricted class of
invertible synchronous automata over a binary alphabet. We give faithful, self-similar actions …

Classification of inverse semigroups generated by two-state partially defined invertible automata
over the two-symbol alphabet Page 1 Algebra and Discrete Mathematics RESEARCH ARTICLE …

In this paper we study semigroups of transformations of free monoids (and transformations of
the corresponding tree boundaries) that arise from asynchronous automata. We introduce a …