Mathematics Colloquium: Alex Bishop
Topic: The Co-Word Problem for Bounded Automata Groups is ET0L
A well-studied and interesting problem, known as the word problem, is to classify groups by how difficult it is to distinguish different elements. In this talk, we will see examples of a different way of viewing this problem, i.e. in terms of the so-called co-word problem; the main result of this talk being that a heavily studied class of groups, known as bounded automata, has a co-word problem which lies in the class of ET0L languages.
This talk will not require any in-depth prior knowledge of formal language theory or group theory and will be aimed at a general audience.