|
|
|
|
1 |
|
|
|
Introduction, Finite Automata, Regular Expressions |
|
|
|
|
|
|
|
2 |
|
|
|
Nondeterminism, Closure Properties, Regular Expressions ↔ FA |
|
|
|
|
|
|
|
3 |
|
|
|
Regular Pumping Lemma, Context Free Languages |
|
|
|
|
|
|
|
4 |
|
|
|
Pushdown Automata, CFG ↔ PDA |
|
|
|
|
|
|
|
5 |
|
|
|
CF Pumping Lemma, Turing Machines |
|
|
|
|
|
|
|
6 |
|
|
|
TM Variants, Church-Turing Thesis |
|
|
|
|
|
|
|
7 |
|
|
|
Decision Problems for Automata and Grammars |
|
|
|
|
|
|
|
8 |
|
|
|
Undecidability |
|
|
|
|
|
|
|
9 |
|
|
|
Reducibility |
|
|
|
|
|
|
|
10 |
|
|
|
Linearly Bounded Automata, PCP |
|
|
|
|
|
|
|
11 |
|
|
|
Recursion Theorem |
|
|
|
|
|
|
|
12 |
|
|
|
Time Complexity |
|
|
|
|
|
|
|
13 |
|
|
|
P and NP, SAT, Poly-time Reducibility |
|
|
|
|
|
|
|
14 |
|
|
|
Midterm Exam |
|
|
|
|
|
|
|
15 |
|
|
|
NP-Completeness |
|
|
|
|
|
|
|
16 |
|
|
|
Cook-Levin Theorem |
|
|
|
|
|
|
|
17 |
|
|
|
Space Complexity |
|
|
|
|
|
|
|
18 |
|
|
|
PSPACE, TQBF, Savitch's Theorem |
|
|
|
|
|
|
|
19 |
|
|
|
Games, Generalized Geography |
|
|
|
|
|
|
|
20 |
|
|
|
L and NL, NL=coNL |
|
|
|
|
|
|
|
21 |
|
|
|
Hierarchy Theorems |
|
|
|
|
|
|
|
22 |
|
|
|
Provably Intractable Problems, Oracles |
|
|
|
|
|
|
|
23 |
|
|
|
Probabilistic Computation, BPP |
|
|
|
|
|
|
|
24 |
|
|
|
Probabilistic Computation, contd. |
|
|
|
|
|
|
|
25 |
|
|
|
Interactive Proof Systems, IP |
|
|
|
|
|
|
|
26 |
|
|
|
Final Exam |
|
|
|