Algorithmic problems in automaton groups
Time and place
4 PM on Friday, October 22nd, 2010; GC 5417
Zoran Sunik (Texas A&M University)
Abstract
Abstract: It is well known that the word problem is decidable in automaton groups (in no worse than exponential time). We will provide a survey of many other problems (some general and well known, some specific only to groups of tree automorphisms). In most cases, it is not known if the given problems are decidable, except in some limited settings. We will present a recent result, obtained jointly with Ventura, showing that the conjugacy problem is undecidable in automaton groups.
