15453 Formal Languages, Automata, and Computation
Lecture 22: Mapping Reductions
We finish the discussion of computation histories by showing that
the question if a grammar generates every word is undecidable. We then
abstract from many of the examples we have seen to develop the notion of
mapping reduction which can be used to show decidability,
undecidability, and related properties.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
