On a free group of transformations defined by an automaton
Group Theory
2007-05-23 v2
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.
Cite
@article{arxiv.math/0601231,
title = {On a free group of transformations defined by an automaton},
author = {Mariya Vorobets and Yaroslav Vorobets},
journal= {arXiv preprint arXiv:math/0601231},
year = {2007}
}
Comments
19 pages, 4 figures