Automata over a binary alphabet generating free groups of even rank
Steinberg, Benjamin · Vorobets, Mariya · Vorobets, Yaroslav
Original · EN
We construct automata over a binary alphabet with 2n states, n≥ 2, whose states freely generate a free group of rank 2n. Combined with previous work, this shows that a free group of every finite rank can be generated by finite automata over a binary alphabet. We also construct free products of cyclic groups of order two via such automata.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.