notes
- Thu Jan 17 : intro class
- Tue Jan 25 : discuss chap 0 (math prelims); start chap 1 (finite automata, regular languages)
- Thu Jan 27 : continue with DFA, NFA
- Tue Feb 1 : equivalence of DFA, NFA, and regular expressions.
- Thu Feb 3 : on-regular languages and pumping lemma
- Tue Feb 8 : finish DFA chapter; start grammars
- Tue Feb 15: homework; parsers
- Thu Feb 17: finish PDA chapter: equivalence proofs, pumping lemma, AnBnCn
- Tue Feb 22: everyone was sick last week; do last Thu stuff.
- Tue Mar 1: start Turing machines
- Thu Mar 3: virtual turing machines
- spring break
- Tue Mar 29: continue (finish?) discussion of decidability (chap 4)
- Thu Apr 14 : Chaitin's constant
- Thu Apr 21 : P and NP
- Tue Apr 3 : last class ...