Created: Wed 10 Sep 2003
Last modified:
Note: This is an approximate syllabus; it may change at any time.
- Lecture 01, Wed 09-10-03
- Introduction; admistrivia; overview of CSU390
- Reading: Sipser 0
- Lecture 02, Mon 09-15-03
- Math primer; DFAs, state diagrams and examples
- Reading: Sipser 0, 1.1
- Lecture 03, Wed 09-17-03
- Formal definitions; regular languages; regular operations; regular expressions
- Reading: Sipser 1.1
- Homework 01 assigned
- Lecture 04, Mon 09-22-03
- Closure properties; non-determinism; equivalence of NFAs and DFAs
- Reading: Sipser 1.2
- Lecture 05, Wed 09-24-03
- Finish equivalence of NFAs and DFAs; regular expressions; equivalence of RE and FA
- Reading: Sipser 1.3
- Homework 01 due
- Homework 02 assigned
- Lecture 06, Mon 09-29-03
- Finish equivalence of RE and FA;
non-regular languages and the Pumping Lemma
- Reading: Sipser 1.4
- Lecture 07, Wed 10-01-03
- The Pumping Lemma; closure properties; minimization of FA
- Reading: Sipser 1.4
- Homework 02 due
- Homework 03 assigned
- Lecture 08, Mon 10-06-03
- Context-free languages; context-free grammars; ambiguity
- Reading: Sipser 2.1-2.2
- Lecture 09, Wed 10-08-03
- Finish ambiguity; compare RLs and CFLs; pushdown automata
- Reading: Sipser 2.1-2.2
- Homework 03 due
- Homework 04 assigned
- Lecture 10, Wed 10-15-03
- Lecture 11, Mon 10-20-03
- Pumping Lemma for CFLs; closure properties
- Reading: Sipser 2.3
- Lecture 12, Wed 10-22-03
- Turing Machines; state diagrams and examples; Church-Turing thesis
- Reading: Sipser 3.1, 3.3
- Fri 10-24-03
- Lecture 13, Mon 10-27-03
- Wed 10-29-03
- Lecture 14, Mon 11-03-03
- Formal definitions; decidable and recognizable languages
- Reading: Sipser 3.1, 3.3
- Lecture 15, Wed 11-05-03
- Turing Machine variants: multi-tape and non-determinisitic
- Reading: Sipser 3.2
- Lecture 16, Mon 11-10-03
- Decidability; cardinality of infinite sets; diagonalization
- Reading: Sipser 4.1, 4.2
- Homework 06 assigned
- Lecture 17, Wed 11-12-03
- Diagonalization; Halting Problem
- Reading: Sipser 4.2
- Fri 11-15-03
- Lecture 18, Mon 11-17-03
- Reducibility
- Reading: Sipser 5.1-5.3
- Lecture 19, Wed 11-19-03
- Redicibility; time complexity
- Reading: Sipser 7.1
- Homework 07 assigned
- Lecture 20, Mon 11-24-03
- P and NP
- Reading: Sipser 7.2-7.3
- Wed 11-26-03
- Lecture 21, Mon 12-01-03
- Polytime reductions
- Reading: Sipser 7.4
- Lecture 22, Wed 12-03-03
- Lecture 23, Mon 12-08-03
- NP-Completeness
- Reading: Sipser 7.4-7.5
- Lecture 24, Wed 12-10-03
- NP-Completeness
- Reading: Sipser 7.4-7.5
- Homework 09 due
- Fri 12-19-03
- Final exam
- 1pm, 320 Shillman Hall
Switch to:
jaa@ccs.neu.edu