Overview
Administration
Calendar
Lecture Notes
Assignments
Links
Change Log
Projects

• For Exam 1:
  • Introduction
  • Math Review
  • Deterministic Finite Automata Definition
  • Non-Deterministic Finite Automata
  • Regular Languages
  • Pumping Lemma
  • Transducers
  • Topics for Exam 1
• 2/15: Exam 1
• For Exam 2
  • Context Free Grammars
  • Push Down Automata
  • CFGs and PDAs
  • Extra notes on PDA to CFG process
  • Pumping Lemma for CFGs
  • Turing Machines
  • Topics for Exam 2
• For Final Exam
  • Variations of Turing Machines
  • Algorithms - SAT
  • Algorithms and TMs
  • Decidability
  • Undecidability
  • Universal Turing Machine
  • Reducibility: The Halting Problem and Undecidable Languages
  • Complexity
  • The Class P
  • The Class NP
  • The Class NP-Complete
  • Beyond NP-Complete
  • Table of Languages
  • Final Exam Review
• Extra
  • The Micron Automata Processor Chip
  • Quantum Computing
• 12/15: Final Exam