|
Organizers |
Free groups defined by finite automata
by
Yaroslav Vorobets
Texas A&M University
Coauthors: Mariya Vorobets, Benjamin Steinberg
An invertible finite automaton canonically defines a finitely generated group of automorphisms of a regular rooted tree. We will describe a class of finite automata that define free nonabelian groups. Freeness is established via the dual automaton approach, which provides a new techniques to solve the word problem for automaton groups.
Date received: December 15, 2006
Copyright © 2006 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # catr-10.