Week |
Dates |
Topic |
Slides |
PS |
01 |
May 31 |
Course Introduction and Administrivia |
|
|
Jun. 02 |
Regular Languages: Deterministic Finite Automata (DFA) |
|
02 |
Jun. 07 |
Non-Deterministic Finite Automata (NFA) |
|
|
Jun. 09 |
Regular Expressions (RE), Closure Properties and Equivalences |
|
03 |
Jun. 14 |
Non-Regular Languages, Pumping Lemma |
|
|
Jun. 16 |
Context-Free Languages (CFL): Context-Free Grammars |
|
04 |
Jun. 21 |
midterm exam i |
Jun. 23 |
Normal Forms, Dealing with Language Ambiguity |
|
|
05 |
Jun. 28 |
Push-Down Automata |
|
|
Jun. 30 |
Pumping Lemma for CFL, In-class problem solving #02 |
|
06 |
Jul. 05 |
Properties of CFL and their Equivalence |
|
|
Jul. 07 |
Recursively Enumerable Languages (REL): Recursive vs. REL |
|
07 |
Jul. 12 |
Turing Machines (TM) |
|
|
Jul. 14 |
|
08 |
Jul. 19 |
midterm exam ii |
Jul. 21 |
Computational Complexity: Halting Problem |
|
|
09 |
Jul. 26 |
Undecidability, Diagonalization Principle |
|
|
Jul. 28 |
Satisfiability, NP-Completeness |
|
10 |
Aug. 02 |
MS Research Presentations |
|
|
Aug. 04 |
final Exam: 10:15 -- 12:00 p.m. |