2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/107482We 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 figuresGroup Theory20E05; 20E08On a free group of transformations defined by an automatontext