Date |
Topic |
Reading |
Homework |
| May 27 |
Logistics, Introduction to course, Languages, Proofs, Finite automata and regular languages, Nondeterministic finite automata |
Chapter 0, Section 1.1 and 1.2 |
Homework 1 |
| May 29 |
Equivalence of NFAs and DFAs, Closure properties under regular operations, regular expressions and finite automata |
Section 1.2 and 1.3 |
|
| June 1 |
Pumping lemma for regular languages, Context-free grammars |
Section 1.4 and 2.1 |
|
| June 3 |
Quiz 1
Design of context-free grammars and Chomsky normal form |
Section 2.1 | Homework 2 |
| June 8 |
Algorithms for context-free grammars, Pumping lemma for context-free languages |
Section 2.3 |
|
| June 10 |
Definition of Turing machines, Variants of Turing machines |
Section 3.1 and 3.2 |
Homework 3 |
| June 15 |
Decidable and undecidable languages, Undecidability of the language ATM |
Section 4.1 and 4.2 | |
| June 17 |
Quiz 2 Other undecidable languages |
Section 5.1 | Homework 4 |
| June 22 |
Time complexity and classes P and NP |
Section 7.1, 7.2 and 7.3 |
|
| June 24 |
Poly-time reductions and NP-completeness |
Section 7.4 | Homework 5 |
| June 29 |
NP-completeness |
Section 7.4 |
|
| July 1 |
Final Exam |