Two-state Mealy automata of intermediate growth over a two-letter alphabet (Q1810168)

Examples of constructions of semigroups of intermediate growth have been described by transformations defined by Mealy automata. These constructions have led to the problem of constructing Mealy automata to show the existence of new semigroups of intermediate growth. As a result, automata with \(m\) states over an \(n\)-letter alphabet have been constructed for \(m\geq 2\), \(n\geq 3\) or \(m\geq 3\), \(n\geq 2\) that define semigroups of intermediate growth. In this paper, the authors construct such automata for the case \(m=2\), \(n=2\).