Credits: 4 units
The following books are recommended for further reading:
Copies of all of the above books are on reserve at the Engineering library.
Lec. | Date | Topics (with PDFs of lecture slides, if applicable) | Required Reading | Homeworks & Milestones |
---|---|---|---|---|
1 | 1/22 | Course Overview; Introduction to Finite Automata (PDF2up, PDF ) | Sipser Ch. 0, 1.1 | |
2 | 1/24 | Finite Automata: DFAs and NFAs ( PDF2up, PDF ) | Sipser 1.1, 1.2 | HW 1 out |
3 | 1/29 | Equivalence of DFAs and NFAs, closure of regular operations ( PDF2up, PDF ) | Sipser 1.2 | |
4 | 1/31 | Regular expressions and equivalence with finite automata ( PDF2up, PDF ) | Sipser 1.3 | HW 1 due; HW 2 out |
5 | 2/5 | Pumping lemma and non-regular languages (no slides) | Sipser 1.4 | |
6 | 2/7 | Minimization of DFAs; the Myhill-Nerode theorem ( PDF2up, PDF ) | Handout | HW 2 due; HW 3 out |
7 | 2/12 | Context-free languages: introduction (no slides) | Sipser 2.1 | |
8 | 2/14 | Pushdown automata; equivalence with CFL ( PDF2up, PDF ) | Sipser 2.2 | HW 3 due; HW 4 out |
9 | 2/19 | PDA-CFL equivalence; Pumping lemma for CFLs ( PDF2up, PDF ) | Sipser 2.3 | |
10 | 2/21 | Examples of non-CFLs; Context-sensitive languages; the Chomsky hierarchy (no slides) | Sipser 2.3 | HW 4 due |
11 | 2/26 | No lecture -- midterm | Midterm 1 | |
12 | 2/28 | Turing machines; the Church-Turing thesis ( PDF2up, PDF ) | Sipser 3.1, 3.3 | |
3/4 | No lecture | |||
13 | 3/6 | TM examples and TM variants (no slides) | Sipser 3.2 | HW 5 out |
14 | 3/11 | Decidable languages (no slides) | Sipser 4.1 | |
15 | 3/13 | Diagonalization; The Halting Problem (no slides) | Sipser 4.2 | HW 5 due; HW 6 out |
16 | 3/18 | Reductions between problems; mapping reducibility (no slides) | Sipser 5.1, 5.3 | |
17 | 3/20 | The Post Correspondence Problem ( PPT ) | Sipser 5.1, 5.2 | HW 6 due; HW 7 out |
3/25 | Spring break | |||
3/27 | Spring break | |||
18 | 4/1 | Time complexity; The class P | Sipser 7.1, 7.2 | |
19 | 4/3 | The classes NP and co-NP; Examples; Polynomial-time reductions | Sipser 7.3, 7.4 | HW 7 due; HW 8 out |
20 | 4/8 | NP-completeness; examples | Sipser 7.4, 7.5 | |
21 | 4/10 | Proof of Cook-Levin theorem, review of reductions | Sipser 7.4 | HW 8 due Friday 4/11 by 5 pm |
22 | 4/15 | PSPACE and NPSPACE; Savitch's theorem | Sipser 8.1, 8.2 | |
23 | 4/17 | No lecture -- midterm | Midterm 2 | |
24 | 4/22 | PSPACE-completeness; The QBF problem | Sipser 8.3 | |
25 | 4/24 | The classes L and NL; Log-space reductions; NL-completeness | Sipser 8.4, 8.5 | HW 9 out |
26 | 4/29 | The Space Hierarchy Theorem; NP and co-NP | Sipser 9.1 | |
27 | 5/1 | The Time Hierarchy Theorem | Sipser 9.1 | HW 10 out; HW 9 due |
28 | 5/6 | Probabilistic complexity classes | Sipser 10.2 | |
29 | 5/8 | Special topic: Phase transitions in SAT ; Course wrap-up | HW 10 due | |
5/20 | Final Exam, 8 - 11 am, in 219 Dwinelle (Level E) |
Academic Dishonesty: Copying solutions or code, in whole or in part, from other students or any other source without acknowledgment constitutes cheating. Any student found to be cheating in this class risks automatically receiving an F grade and referral to the Office of Student Conduct. The Department's Policy on Academic Dishonesty is available at http://www.eecs.berkeley.edu/Policies/acad.dis.shtml .
Special Requests: It is your responsibility to see the instructor in a timely fashion for accommodation of religious beliefs, disabilities, and other special circumstances.
Feedback: The course staff always welcome your suggestions and feedback on what we could do better. Please feel free to contact us in person or via e-mail. If you would like to send anonymous comments or criticisms, you can use an anonymous remailer, like this one, to send us e-mail without revealing your identity.