CS 381 - Introduction to Theory of Computing, Summer 2005

Lecture topics and relevant textbook references, as well as any additional in-class handouts, will be posted here. You are encouraged to take some time before each lecture to look at the textbook section that will be covered; this will make your class time a lot more productive.

The textbook is divided into sections called Lectures; the references given below are to these sections. This schedule is tentative; you should consider all topics listed for future dates as guidelines rather than guarantees of what will be covered.

Part 1 - Automata and regular languages

Part 2 - Context-free languages

Part 3 - Effective computability and Turing Machines