itec420 lecture notes

date	topic	reading
week 1
Aug.23	The 45-min. version of the entire semester's content
Aug.25	set-definitions-intro.html
week 2
Aug.30	set-definitions-cardinalities.html (through Σ^* countable)
Sep.01	finish set-definitions-cardinalities.html; start logic-notation-intro.html
week 3
Sep.06	finish logic-notation-intro.html
Sep.08	dfsm.html Resume formalizing deterministic FSMs: configurations; computations; acceptance
week 4
Sep.13	start ndfsm.html non-deterministic FSMs: examples; acceptance.
Sep.15	Finish previous topic
week 5
Sep.20	Start Equivalence of DFSM and NDFSMs (see slides): subset-construction
Sep.22	Finish previous topic
week 6
Sep.27	Regexp: examples; definition
Sep.29	a regexp has equivalent NDFSM
week 7
Oct.04	a NDFSM has equivalent regexp
Oct.06	Book .ppts Ch08: non-regular languages via pumping
week 8
Oct.11	Book .ppts Ch08: non-regular languages via closure principles; Ch12: PDA intro
Oct.13	exam01
week 9
Oct.18	Book .ppts Ch11a: CFG intro (example, terms, parse tree)
Oct.20	Book .ppts Ch11a: CFG (formal defn; ambiguity; mention precedence)
week10
Oct.25	Book .ppts Ch13: CFG ~ PDA
Oct.27	Book .ppts Ch13: pumping `a`ⁿ`b`ⁿ`c`ⁿ
week11
Nov.01	(cont.)
Nov.03	Book .ppts Ch17a: TM intro; simulator site
week12
Nov.08	Book .ppts Ch17a: TM practice. recording recording
Nov.10	Book .ppts Ch17b: TM variants: multi-track, multi-tape, Non-deterministic. recording
week13
Nov.15	Book .ppts TMs: Deciding vs. Semi-Deciding; NDTM → DTM construction
Nov.17	Book .ppts Ch17c: Encoding a TM
thanksgiving br eak
week14
Nov.29	Book .ppts Undecidability: The Halting Problem
Dec.01	Book .ppts Reducing undecidable problems: HALT-ON-EMPTY and CFG-ALL are undecidable
week15
Dec.06	Book .ppts P vs NP (definitions, reductions, completeness); SAT is NP-complete (Cook's Theorem)
finals week
Dec.08 (Thu) 10:15	final exam	[0,∞) `:-)`