CSI 350 - Theory of Computation
- 350 Review Sheets
- Final Exam
- Chapter 17 P v NP
- Quiz #10: Languages, Closure, Reducibility related to TMs
- Chapter 15: 1-8
- Chapter 14: 1-4,6
- Chapter 13: 1-10,14,16
- Quiz #9: Turing Machines
- Chapter 12: 1-6, 8-10, 12-16, 19-20, 23
- Chapter 11: 1-17
- Quiz #8: Tightest Classification Proofs, Closure, Properties
- Chapter 9: 9, 12,13, 15
- Quiz #7: CNF, PL
- Chapter 9: 1-6, 8-11, 16
- CNF example: CNF.txt
- Quiz #6: PDAs, CFLs
- Chapter 7: 1-6, 8-18, #19: arf
- Quiz #5: CFGs, CFLs
- Chapter 6: 1-8,10-14, 17-20
- Review Session Log
- Quiz #4: Closure
- Closure Properties: Kleene, complement, intersect, Chapter 4: 4.1-7
- Quiz #3: 2/11, Pumping Lemma
- Chapter 4: 4.8-15
- Pumping Lemma: 0^i 1^j, ww^R, ww, 0^n 1^n 2^n, a^2^n, 0^n 1^m 0^n, a^i b^j c^k i=j when k=1
- Quiz #2: 2/4, Chapter 3
- Chapter 3: 1-14
- Quiz #1: 1/28, Chapter 1 & Chapter 2
- Chapter 2: 1-12, 13 (hard), 14-17, 18 (extra credit)
- Chapter 1: All
- Recall starred problems are in the back - answered.
- Syllabus is here.