CS121/CSCI E-207 FALL 2012

Schedule

(colors indicate weeks)

Readings are in Sipser's Introduction to the Theory of Computation, 2nd ed. unless otherwise specified.

# Day Date Topic & Lecture Notes Readings Other Handouts Problem Sets CS121 Problem Sets CSCI E-207
1 Tu Sept. 4 Introduction and Overview Preface

syllabus, survey

 

 

Unit 1: Finite Automata
2 Th Sept. 6

Strings, Languages,
and Induction

Ch. 0

section0.pdf

ps0.pdf
ps0.zip (source)
ps0ext.pdf
ps0ext.zip (source)
Section 0 recording
3 Tu Sept. 11 Finite Automata Sec. 1.1-1.2

 

PS 0 due
ps1.pdf
ps1.zip (source)
ps1ext.pdf
ps1ext.zip (source)
4 Th Sept. 13 NFAs vs. DFAs, Closure Properties Sec 1.1-1.2

section1.pdf

PS 0 due (Fri)
Section 1 recording
5 Tu Sept. 18 Regular Expressions Sec 1.3   PS 1 due (Wed)
ps2.pdf
ps2.zip (source)
ps2ext.pdf
ps2ext.zip (source)
6 Th Sept. 20 Regular Languages, Countability Sec 1.3,
Sec 4.2 (pp. 174-178)
section2.pdf   PS 1 due (Fri)
Section 2 recording
7 Tu Sept. 25 Nonregular languages Sec 4.2 (pp. 174-178),
Sec. 1.4

 

PS 2 due
ps3.pdf
ps3.zip (source)
ps3ext.pdf
ps3ext.zip (source)
8 Th Sept. 27 Pumping & More Sec. 1.4

section3.pdf

  PS 2 due (Fri)
Unit 2: Context-Free Languages
9 Tu Oct. 2 Context-free Grammars Sec. 2.1

 

PS 3 due
ps4.pdf
ps4.zip (source)
ps4ext.pdf
ps4ext.zip (source)
Section 3 recording
10 Th Oct. 4 Pushdown Automata Sec. 2.2 section4.pdf   PS 3 due (Fri)
11 Tu Oct. 9 CFGs vs. PDAs, Non-CF Languages Sec. 2.2, 2.3

 

PS 4 due
ps5.pdf
ps5.zip (source)
Note: PS5 revised 10/12
ps5ext.pdf
ps5ext.zip (source)
Note: PS5 revised 10/12
Section 4 recording
12 Th Oct. 11 CF Recognition Sec. 2.1

section5.pdf

  PS 4 due (Fri)
Unit 3: Computability
13 Tu Oct. 16 Turing Machines Sec. 3.1

Hilbert paper
Turing paper

PS 5 due
Practice midterm

Section 5 recording
Note: fast-forward two minutes until I remember to turn on the microphone
14 Th Oct. 18 The Church-Turing Thesis Sec. 3.2, 3.3     PS 5 due (Fri)
  Tu Oct. 23

Midterm Examination
on material through Lecture 11/PS5

ps6.pdf
ps6.zip (source)
ps6ext.pdf
ps6ext.zip (source)
15 Th Oct. 25 Recognizability & Decidability Sec. 3.2, 3.3, 4.1 section6.pdf   Section 6 recording
16 Tu Oct. 30 Decidability & the Universal TM Sec. 4.1, 4.2


PS 6 due (WED)

ps7.pdf
ps7.zip (source)
ps7ext.pdf
ps7ext.zip (source)
17 Th Nov. 1 Undecidability Sec. 4.2, 5.1 section7.pdf   PS 6 due (Fri)
18 Tu Nov. 6 Reducibility Sec. 5.1, 5.3 PS 7 due
ps8.pdf
ps8.zip (source)
ps8ext.pdf
ps8ext.zip (source)
Section 7 recording
Unit 4: Computational Complexity
19 Th Nov. 8 Computational Complexity Sec. 7.1 survey results
section8.pdf
  PS 7 due (Fri)
20 Tu Nov. 13 Polynomial Time Sec. 7.2


PS 8 due
ps9.pdf
ps9.zip (source)
Section 8 recording
ps9ext.pdf
ps9ext.zip (source)
21 Th Nov. 15 NP Sec. 7.3 section9.pdf   PS 8 due (Fri)
22 Tu Nov. 20 P vs. NP, NP-completeness Sec. 7.4, 7.5

 

PS 9 due
ps10.pdf
ps10.zip (source)
Section 9 recording
ps10ext.pdf
ps10ext.zip (source)
  Th Nov. 22

No class - Thanksgiving

23 Tu Nov. 27 More NP-completeness Sec. 7.5 section10.pdf

 

PS 9 due (Monday, November 26)
24 Th Nov. 29

Cook-Levin Thm
& Interactive Proofs

Sec. 7.4, 10.4     Section 10 recording
25 Tu Dec. 4

Zero-Knowledge Proofs & Conclusions

Sec. 10.4

Fall 2010 final
Fall 2011 final

PS 10 due  
         

 

  PS 10 due (Friday, December 7)
  Tue Dec. 11 Review Session 10am-noon, MD G-115 (will be taped)
  Fri Dec. 14

Review Session 6:30-8:30pm, MD G-115 (will not be taped)

  Mon Dec. 17

Final Examination
CS121 students: 2-5pm, Geological Museum Lecture Hall

CSCI E-207 students: 7:40-9:40pm, Sever 209