2 citations · 3 across the 2 of their papers we have counts for
Showing math.GRShow all
3 papers · 1 filter
math.GR2006★ 2 cited
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 states, , whose states freely generate a free group of rank . Combined with previous work, this shows that a fre…
math.GR2006★ 1 cited
On a series of finite automata defining free transformation groups
Mariya Vorobets, Yaroslav Vorobets
We introduce two series of finite automata starting from the so-called Aleshin and Bellaterra automata. We prove that each automaton in the first series defines a free non-Abelian…
math.GR2006
On a free group of transformations defined by an automaton
Mariya Vorobets, Yaroslav Vorobets
We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3.