Overview
Administration
Calendar
Lecture Notes
Assignments
Links
Change Log
Projects

• For Exam 1:
  • 8/24: Introduction
  • 8/26: Math Review
  • 8/29: SAT Solving
  • 8/26: Additional SAT Solving
  • 8/31: Deterministic Finite Automata Definition
  • 9/5: Non-Deterministic Finite Automata
  • 9/7: Regular Languages
  • 9/14,19: Pumping Lemma
  • 9/28: Topics for Exam 1
• 10/3: Exam 1
• For Exam 2
  • 9/21: Context Free Grammars
  • 9/26: Push Down Automata
  • 10/5: CFGs and PDAs
  • 10/24: Extra notes on PDA to CFG process
  • 10/10: Pumping Lemma for CFGs
  • 10/24: Turing Machines
  • 10/31: Variations of Turing Machines
  • 11/14: Exam 2
• For Final Exam
  • 11/7: Algorithms, Graphs
  • 11/7: Decidability
  • 11/16: Combinators
  • 11/21: Undecidability
  • 11/21: Universal Turing Machine
  • 11/21: Undecidable Languages
  • Complexity
  • The Class P
  • The Class NP
  • The Class NP-Complete
  • Beyond NP-Complete
  • The Micron Automata Processor Chip
  • Quantum Computing
  • Final Exam Review
  • Language Class Review Sheet
• 12/15: Final Exam