On a free group of transformations defined by an automaton

Simple item page
dc.creatorVorobets, Mariya
dc.creatorVorobets, Yaroslav
dc.date2006-01-10
dc.date2006-03-10
dc.date.accessioned2026-07-07T06:58:45Z
dc.date.available2026-07-07T06:58:45Z
dc.descriptionWe 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.
dc.description19 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0601231
dc.identifierhttp://arxiv.org/abs/math/0601231
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107482
dc.subjectGroup Theory
dc.subject20E05; 20E08
dc.titleOn a free group of transformations defined by an automaton
dc.typetext

Files

Collections

arXiv