Abstract:
We consider the sequence of 2-state Mealy automata over the finite alphabets, that have polynomial growth orders and define the infinitely presented automatic transformation semigroups.
Keywords:growth of Mealy automata, polynomial growth order, infinitely presented semigroup.