Undecidability and incompleteness results in automata theory

Authors:
J. Hartmanis
Affiliations:
Cornell Univ., Ithaca, NY
Venue:
A half-century of automata theory
Year:
2001

Citing 3
Cited 0

On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Independence results in computer science

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automata theory is inextricably intertwined with undecidability and incompleteness results. This papers explores the beautiful panorama of undecidability and Gödel-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.