Week |
Topic |
Slides |
PS |
01 |
Course Introduction and Administrivia |
|
|
Regular Languages: Deterministic Finite Automata (DFA) |
|
02 |
In-class Problem Solving #01 |
|
|
Non-Deterministic Finite Automata (NFA) |
|
|
03 |
Equivalence and Regular Expressions |
|
|
Regular Grammer |
|
|
04 |
Closure Properties |
|
|
Non-Regular Languages Pumping Lemma |
|
|
05 |
Context-Free Languages (CFL): |
|
|
Context-Free Grammars |
|
|
06 |
midterm exam i
|
Push-Down Automata (PDA), Normal Forms |
|
|
07 |
Pumping Lemma for CFL |
|
|
CFL Properties and Equivalence |
|
|
08 |
Recursively-Enumerable Languages (REL): |
|
|
Recursive vs. REL |
|
|
09 |
Turing Machines (TM) |
|
|
|
|
10 |
Halting Problem |
| |
midterm exam ii
|
11 |
-- buffer space for fallover -- |
|
|
Computational Complexity: Undecidability |
|
|
12 |
Complexity Classes: P, NP, NP-C |
|
|
P vs. NP |
|
|
13 |
Satisfiability, Cook’s Theorem |
|
|
Church-Turing Thesis |
|
|
14 |
Topics TBA |
|
|
|
|
15 |
thanksgiving break
|
16 |
|
|
|
|
|
|
17 |
final Exam: Tuesday, Dec. 10 @ 10:00 -- 11:40 a.m.
|