15453 Formal Languages, Automata, and Computation
Lecture 29: Some Problems in P
We show that graph reachability can be solved in polynomial time. We also
demonstrate that contextfree languages can be recognized in polynomial time,
although the algorithm we used to show the decidability of contextfree
languages does not run in polynomial time.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
