Representing Infinite Structures by Automata

Date: Tuesday, November 15, 2011
Speaker: Sasha Rubin
Venue: TU Vienna

Automata theory in the 1960s gave a method to prove that certain logical theoriesare decidable. Implicit in this work is the notion of an automatic structure. I will present essential properties of automatic structures, give concrete examples, and mention some foundational problems that are still open. Basic familiarity with logic and automata areenough to follow this talk.


Posted in RiSE Seminar