ECS 120 - List of Lecture Topics
	Lecture	Topic
Week 1	Lect 1 - T 1/7	Introdution. Examples of DFAs.
	Lect 2 - R 1/9	Strings, languages, etc.. Practice with DFA design. Definition of DFAs.
Week 2	Lect 3 - T 1/14	Language of a DFA. Induction and pigeonhole proofs. Closure properties. Product construction.
	Lect 4 - R 1/14	Quiz 1. Closure under intersection. Under concatenation? Why multiple models. NFAs.
Week 3	Lect 5 - T 1/21	Defn of NFAs. Closure properties. L is accepted by an NFA iff L is accepted by a DFA.
	Lect 6 - R 1/23	Regular expressions and their languges. Equivalence to NFAs/DFAs. A not-regular languge.
Week 4	Lect 7 - T 1/28	The pumping lemma. Exercises on regular languages.
	Lect 8 - R 1/30	Quiz 2. Definitions and examples of CFGs. Ambiguity.
Week 5	Lect 9 - T 2/4	Exercise on CFGs. PDAs. PDA's recognize the CFLs.
	Lect 10 - R 2/6	Midterm
Week 6	Lect 11 - T 2/11	Pumping Lemma for CFLs. Turing machines.
	Lect 12 - R 2/13	Decidable and acceptable languages. Turing-equivalent models.
Week 7	Lect 13 - T 2/18	Church-Turing thesis. Properties of decidable and acceptable languages.
	Lect 14 - R 2/20	Decision procedures.
Week 8	Lect 15 - T 2/25	Diagnolization. Undecidability of Atm. Reducibility.
	Lect 16 - R 2/27	Reductions.
Week 9	Lect 17 - T 3/4	Quiz 3. Reductions. The class P.
	Lect 18 - R 3/6	NP. NP-Completeness. Cook-Levin Theorem.
Week 10	Lect 19 - T 3/11	NP-Completeness reductions. Goodbye!
Week 11	10:30 am - 3/19	Final