Week | Lecture | Date | Topic | Reading | Slides | Homework |
1 | 1 | Aug 22 | Class Logistics, Mathematical Notions and Terminology | Chapter 0, Section 2 | Intro1, Intro2 | |
2 | Aug 24 | Definitions, Theorems and Proofs | Chapter 0, Section 3 | Intro3, Intro4 | |
2 | 3 | Aug 29 | Formal Definition of Finite Automation, | Chapter 1, Section 1 | Automata1, Automata2 | HW1 |
4 | Aug 31 | Formal Definition of Computation, Designing Finite Automata | Chapter 1, Section 1 | Automata3, Automata4 | |
3 | 5 | Sep 05 | Review of DFA | Chapter 1, Section 1 | | HW2 |
6 | Sep 07 | Nondeterminism, Equivalence between NFA and DFA | Chapter 1, Section 2 | Automata5, Automata6 | |
4 | 7 | Sep 12
| Closure under regular operations | Chapter 1, Section 2 | Automata7 | |
8 | Sep 14 | Regular Expressions, Equivalence with Finite Automata | Chapter 1, Section 3 | Regular Expression 1, Regular Expression 2 | HW3 |
5 | 9 | Sep 19 | Equivalence with Finite Automata Contd, Pumping Lemma | Chapter 1, Section 3, 4 | Pumping Lemma | |
10 | Sep 21 | Pumping Lemma Contd, Review | Chapter 1, Section 4 | | |
6 | 11 | Sep 26
| Context Free Grammar and derivation | Chapter 2, Section 1 | CFG | HW4 |
12 | Sep 28 | Ambiguity and Chomsky normal form | Chapter 2, Section 1 | Chomsky | |
7 | Oct 03, Midterm 1 | |
13 | Oct 05 | Push Down Automata | Chapter 2, Section 2 | pda1 | |
8 | 14 | Oct 10
| Equivalence with Context Free Grammars | Chapter 2, Section 2 | pda2 | HW5 |
15 | Oct 12 | Equivalence Contd, Pumping Lemma for Context-free languages Contd., Review | Chapter 2, Section 2,3 | pumping_contextfree | |
9 | Oct 17, Fall Break, No Class | |
16 | Oct 19 | Pumping Lemma Contd., Review | | | HW6 |
10 | 17 | Oct 24
| Riview CFL | | | |
18 | Oct 26 | Turing Machine | Chapter 3, Section 1 | turing1 | HW7 |
11 | 19 | Oct 31
| Examples and variants of Turing Machines | Chapter 3, Section 1, 2 | turing2, turing3 | |
20 | Nov 02 | Variants of Turing Machine Contd. | Chapter 3, Section 2 | | |
12 | November 07, Midterm 2 | |
21 | Nov 09 | Definition of Algorithms, Decidable Language | Chapter 3, Section 3 | turing4, decide1 | |
13 | 22 | Nov 14
| Decidable problems from regular language, context-free language | Chapter 4, Section 1 | decide2 | HW8 |
23 | Nov 16 | Diagonalization method | Chapter 4, Section 2 | decide3 | |
14 | 24 | Nov 21
| Diagonalization method contd., Halting Problem | Chapter 4, Section 2 | | HW9 |
Nov 23, Thanksgiving Holiday, No Class | |
15 | 25 | Nov 28
| Halting Problem | Chapter 4, Section 2 | | |
26 | Nov 30 | Review | | | |
15 | 25 | Dec 05 | Final | | | |
| |