Examples of defining groups by finite automata
Victoriia Korchemna · arXiv (Cornell University) · 2018
We construct the groups $$ and $$, using 3-state automata over the alphabets $\{1,2,3\}$ and $\{1,2,3,4\}$. In addition, we show, how to define direct powers of $G$ by automaton (when for $G$ it's given), keeping the alphabet.