On a free group of transformations defined by an automaton

arxiv: math/0601231 · v2 · submitted 2006-01-10 · 🧮 math.GR

Mariya Vorobets , Yaroslav Vorobets This is my paper

classification 🧮 math.GR

keywords automatondefinedfreegroupautomorphismsbinarycertaingenerate

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.