On a free group of transformations defined by an automaton
arXiv:math/0601231
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.
19 pages, 4 figures