The Proof of the Cook-Levin theorem
A very nice paper on the P vs NP problem by Stephen Cook.
A little paper with a more detailed description of the relationship between PDAs and parsing.
Here is the link to the notes on pushdown automata and parsing. Here is the link to the notes on unit rules and erasing rules. Here is the link to the notes on constucting regular expressions from automata.
Wondering about the difference between CS 503 and CS 5003?
See the Problems directory (link above) for advice about which problems to do to prepare for individual quizzes.