15:00
Automatic structures are algebraic structures, such as graphs, groups
and partial orders, that can be presented by automata. By varying the
classes of automata (e.g. finite automata, tree automata, omega-automata)
one varies the classes of automatic structures. The class of all automatic
structures is robust in the sense that it is closed under many natural
algebraic and model-theoretic operations.
In this talk, we give formal definitions to
automatic structures, motivate the study, present many examples, and
explain several fundamental theorems. Some results in the area
are deeply connected with algebra, additive combinatorics, set theory,
and complexity theory.
We then motivate and pose several important unresolved questions in the
area.
Further Information
LMS-NZMS Aitkin Lecture 2019