Lecture Topic Typed Notes In Class Written Notes
Intro Lecture Introduction
Chapter 0
Section 1.1
8/20/24 Notes
NFAs NFAs
Regular Operations
8/22/24 Notes
REs Regular Expressions 8/27/24 Notes
Pumping Lemma Pumping Lemma 8/29/24 Notes
9/3/24 Notes
DFA Minimization Sudkamp Excerpt
Notes
9/5/24 Notes
Context Free Grammars Part I
Part II
9/12/24 Notes
Pushdown Automatas 9/17/24 Notes
9/19/24 Notes
Pumping Lemma for CFL 9/24/24 Notes
Turing Machines Intro to TMs
Drew, Anthony, Chris and Sean's Notes
10/3/24 Notes
Turing Machine Variants Turing Machine Variants 10/15/24 Notes

Lecture Notes

  1. Recursively Enumerable Languages
  2. Halting Problem
  3. Parsing
  4. Greibach Normal Form and DFA Minimization
  5. Reducibility
  6. Mapping Reducibility
  7. Exam #2 Review
  8. The Class P
  9. The Class NP
  10. Polynomial-Time Reducibility
  11. Proof of Cook-Levin Theorem
  12. Final Exam Review