itec420 lecture notes

date	topic	reading
week 1
Aug.27	The 45-min. version of the entire semester's content
Aug.29	set-definitions-intro.html	§1.2–§2.2.5 = p.19.1pdf=4.1book–p.28.2pdf=13.2book
week 2
Sep.03	set-definitions-cardinalities.html (through Σ^* countable)
Sep.05	finish set-definitions-cardinalities.html; start logic-notation-intro.html
week 3
Sep.10	finish logic-notation-intro.html
Sep.12	dfsm.html Resume formalizing deterministic FSMs: configurations; computations; acceptance
week 4
Sep.17	start ndfsm.html non-deterministic FSMs: examples; acceptance.
Sep.19	Finish previous topic
week 5
Sep.24	Start Equivalence of DFSM and NDFSMs (see slides): subset-construction
Sep.26	Finish previous topic
week 6
Oct.01	Regexp: examples; definition
Oct.03	a regexp has equivalent NDFSM
week 7
Oct.08	a NDFSM has equivalent regexp
Oct.10	Book .ppts Ch08: non-regular languages via pumping
week 8
Oct.15	Book .ppts Ch08: non-regular languages via closure principles; Ch12: PDA intro
Oct.17	exam01
week 9
Oct.22	Book .ppts Ch11a: CFG intro (example, terms, parse tree)
Oct.24	Book .ppts Ch11a: CFG (formal defn; ambiguity; mention precedence)
week10
Oct.29	Book .ppts Ch13: CFG ~ PDA
Oct.🎃	Book .ppts Ch13: pumping aⁿbⁿcⁿ
week11
Nov.05	(cont.)
Nov.07	Book .ppts Ch17a: TM intro; simulator site
week12
Nov.12	Book .ppts Ch17a: TM practice. recording recording
Nov.14	Book .ppts Ch17b: TM variants: multi-track, multi-tape, Non-deterministic. recording
week13
Nov.19	Book .ppts TMs: Deciding vs. Semi-Deciding; NDTM → DTM construction
Nov.21	Book .ppts Ch17c: Encoding a TM
thanksgiving br eak
week14
Dec.03	Book .ppts Undecidability: The Halting Problem
Dec.05	Book .ppts Reductions: HALT-ON-epsilon; CFG-ALL
week15
Dec.10	Book .ppts NP and completeness; SAT is NP-complete; one other PTIME reduction
finals week
Dec.10 (Tue) 14:45	final exam	[0,∞) `:-)`