Antonenko O. Semigroups of finite automata transformation.

The thesis is devoted to a study of semigroups generated by automata of special classes, namely, branchless automata and slowmoving automata of finite type and to finding of the class of transition functions of Mealy automata that generates only finite semigroups. Semigroups generated by branchless automata are described. We formulate the maximal requirements on transition functions such that any Mealy automaton with this transition function defines a finite semigroup. We find a generating set of semigroup generated by all slowmoving automata of finite type over two-symbol alphabet and prove that this semigroup has no minimal generating set.