ECS 120 - Winter 02 - List of Lecture Topics |
|||
---|---|---|---|
Lecture | Topic | ||
Week 1 | Lect 1 - T 1/8 | Introduction. Three problems of differing hardness. Strings and languages | |
Lect 2 - R 1/10 | Practice with DFA design. Formal definitions of DFAs and their languages. | ||
Week 2 | Lect 3 - T 1/15 | Closure properties of the DFA-acceptable languages. The product construction. | |
Lect 4 - R 1/17 | NFAs: examples, definitions, and the properties of NFA-acceptable languages. | ||
Week 3 | Lect 5 - T 1/22 | NFA-acceptable languages = DFA-acceptable languages. Regular languages. | |
Lect 6 - R 1/24 | NFA-acc languages are regular. Decisions procedures for reg languages. | ||
Week 4 | Lect 7 - T 1/29 | Finish decision procedures. Lower bounds on DFA size. Showing languages not regular. | |
Lect 8 - R 1/31 | Quiz | ||
Week 5 | Lect 9 - T 2/5 | The pumping lemma, continued. Examples of its use. Start CFLs. | |
Lect 10 - R 2/7 | Definitions for CFLs. Examples. Ambiguity. Regular languages are CF. | ||
Week 6 | Lect 11 - T 2/12 | Regular grammars. NPDAs. NPDAs accept exactly the CFLs. | |
Lect 12 - R 1/14 | Decision procedures for CFLs. The CFL pumping lemma. | ||
Week 7 | Lect 13 - T 2/19 | Finish up CFLs. Turing machines. Decidable and acceptable languages. | |
Lect 14 - R 2/21 | Midterm | ||
Week 8 | Lect 15 - T 2/26 | Alternative TM models. The Church-Turing Thesis. | |
Lect 16 - R 2/28 | Properties of rec/r.e. languages. Undecidability of A_TM. Many-one reductions. | ||
Week 9 | Lect 17 - T 3/5 | Properties of many-one reductions. Sample reductions. | |
Lect 18 - R 3/7 | One final reduction. The classes P and NP. | ||
Week 10 | Lect 19 - T 3/12 | NP-completeness, polytime reductions, the Cook-Levin Theorem, examples. | |
Lect 20 - R 3/14 | Review. More example reductions. Students grade Phil. | ||
Week X | M 3/18, 4-6pm | Final for section 2 (TR 1:30-3 class) | |
F 3/22, 4-6pm | Final for section 1 (TR 10:30-12 class) |