Automata over a binary alphabet generating free groups of even rank

Benjamin Steinberg, Mariya Vorobets, Yaroslav Vorobets

We construct automata over a binary alphabet with $2n$ states, $n\ge 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a fre…