Undecidability and Incompleteness Results in Automata Theory

Abstract

Automata theory is inextricably intertwined with undecidability and incompleteness results. This papers explores the beautiful panorama of undecidability and Godel-like incompleteness results in automata theory that reveals their ubiquity and clarifies and illustrates how the severity of these results changes with the complexity of the problems and the computing power of the automata.