CS 503
Spring term 2008
Worcester Polytechnic Institute

Home

What's New

The Proof of the Cook-Levin theorem

A very nice paper on the P vs NP problem by Stephen Cook.

What's old

Here is the link to the notes on Rice's Theorem.

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.

Course Information

The course information page gives information about: course objectives and prerequisites, the textbook, course staff and office hours, and academic honesty and collaboration guidelines.

Wondering about the difference between CS 503 and CS 5003?

Schedule

The weekly schedule page has the day-to-day schedule, including exam dates and reading assignments.

Problems

Here is the link to the master list of homework problems for the course. (PDF file)

See the Problems directory (link above) for advice about which problems to do to prepare for individual quizzes.


Top of page