Automata groups form a fundamental class of groups, due to their striking properties (Burnside groups, groups of intermediate growth), their applicability (encoding of dynamical systems), and their accessibility to computation. This project will explore the decidability and complexity of these groups’ first order logic, using powerful tools from formal language theory, and will develop robust and well-integrated computer software to manipulate them.
