Videos

Word problems and finite state automata

Presenter
June 15, 2021
Abstract
In this talk I will discuss several ways to solve the word problem for groups by finite automata, including automatic and autostackable structures, along with geometric and topological views of these properties. We apply these algorithms to discrete subgroups of Lie groups and fundamental groups of 3-manifolds. Based on joint projects with M. Brittenham and T. Susse, and with D. Holt, S. Rees, and T. Susse.
Supplementary Materials