Grading and AssignmentsTopTextTopics and Readings

Topics and Readings

The following is a tentative schedule of the topics that will be considered in each class this semester. Check the web page regularly for updates as this schedule is likely to be revised as the semester proceeds. The readings for each topic should be completed before the class with which they are listed.

Date Topic Readings
1) 9/8 Sets, Countability, and Computability
2) 9/11 Strings, Languages, and Deciders Chapter 0
3) 9/13 Deterministic finite automata pages 31-43
4) 9/15 Proving languages are regular
5) 9/18 Introduction to non-deterministic finite automata pages 47-54
6) 9/20 Equivalence of DFAs and NFAs. Closure properties pages 44-47, 54-62
7) 9/22 Regular expressions. Equivalence with finite automata pages 63-76
8) 9/25 Regular expressions. Equivalence with finite automata pages 63-76
9) 9/27 Non-regular languages and the pumping lemma pages 77-82
10) 9/29 More pumping and closure properties.
11) 10/2 State minimization and the MyHill-Nerode theorem problem 1.52 and its solution
12) 10/4 Proving non-regularity with the MyHill-Nerode theorem
13) 10/6 Context-free grammars + languages pages 101-107,
14) 10/11 Context-free Languages
15) 10/16 Context-free Languages + Push Down Automata pages 111-116
16) 10/18 Push Down Automata + Ambiguity pages 107-108
17) 10/20 Pumping Lemma for Context-Free Languages pages 125-130
18) 10/23 Equivalence of PDAs and CFGs + pages 117-124
19) 10/25 Closure Properties of CFGs, Determinism and Turing Machines pages 165-175
20) 10/27 Turing Machines pages 176-187
21) 10/30 The Church-Turing Thesis pages 176-187
22) 11/1 The Church-Turing Thesis pages 176-187
23) 11/3 Decidable and recognizable sets (examples) pages 193-200
24) 11/6 Undecidable sets. Diagonalization pages 201-210
25) 11/8 Undecidable sets. Reductions pages 215-226
26) 11/10 More Reductions
27) 11/13 Computation Histories pages 225-226, 234-238
28) 11/15 Mapping Reduction and Rice's Theorem problem 5.28 and its solution + pages 245-251
29) 11/17 P and NP pages 273-298
30) 11/20 NP-completeness and Reductions pages 299-304
31) 11/27 The Cook-Levin Theorem pages 304-310
32) 11/29 NP-complete problems pages 311-321
33) 12/1 NP-complete problems pages 311-321
34) 12/4 NP-complete problems pages 311-321
35) 12/6 Space Complexity pages 331-336
36) 12/8 Space Complexity


Grading and AssignmentsTopTextTopics and Readings