15-453 Formal Languages, Automata, and Computation
Lecture 17: Decision Procedures
Now that we have gained some experience with Turing recognizable problems,
we will look at Turing decidable languages. The examples are taken from the
development of regular and context-free languages in the course so far. For
the study of the acceptance problem for context-free grammars we introduce the
Chomsky normal form. It will turn out in the end that not every Turing
recognizable language is decidable.