WEEK |
DAY |
ANNOUNCEMENTS |
TOPIC & READING |
LABS/Homework |
1 | Feb 10 | | Introduction (read: Chapter 0 and the course website) | Lab 1 hw 1 |
Feb 12 | | Notation and proof techniques (read: Chapter 0) |
2 | Feb 15 | |
Feb 17 | | Deterministic Finite Automata, Regular Languages (read:1.1) | Lab 2 hw 2 |
Feb 19 | | Deterministic Finite Automata |
3 | Feb 22 | | Nondeterministic Finite Automata (read: 1.2) |
Feb 24 | Add deadline | Lab 3 hw 3 |
Feb 26 | Test 1 (Feb 28) | Regular Expressions (read: 1.3) |
4 | Mar 01 | | Non-regular Languages, the Pumping Lemma (read: 1.4) |
Mar 03 | | Context-Free Grammars (read: 2.1) | Lab 4 hw 4 |
Mar 05 | |
5 | Mar 08 | | Pushdown Automata (read: 2.2) |
Mar 10 | | Lab 5 hw 5 |
Mar 12 | Test 2 (Mar 14) |
6 | Mar 15 | | Non-context-free Languages, the Pumping Lemma for context-free languages (read: 2.3) |
Mar 17 | | Pushdown Automata, non-context-free languages. | Lab 6 |
Mar 19 | | Turing Machines (read: 3.1-3.2) |
7 | Mar 22 | |
Mar 24 | Spring Break |
Mar 26 |
8 | Mar 29 | | Enumerators and Functions (read: 3.3) | Lab7 hw 6 |
Mar 31 | Test 3 (Apr 01) | Computability the Church-Turing Thesis |
Apr 02 | |
9 | Apr 05 | | Decidability and undecidability (read:4.1-4.2 ) | Lab 8 hw 7 |
Apr 07 | |
Apr 09 | |
10 | Apr 12 | | Reductions (read: 5.1, 5.3) | Lab 9 hw 8 |
Apr 14 | |
Apr 16 | Drop ends
Test 4 (Apr 18) |
11 | Apr 19 | | More reductions | Lab 10 hw 9 |
Apr 21 | |
Apr 23 | |
12 | Apr 26 | | time complexity: big O, class P (read: 7.1-7.2) | Lab 11 hw 10 |
Apr 28 | |
Apr 30 | Test 5 (May 02) |
13 | May 03 | | class NP, NP-completeness (read: 7.2-7.5) | Lab 12 |
May 05 | |
May 07 | |