CPSC 326: Theoretical Foundations of Computing

• Syllabus
• 326 team survey
• XP Check
• Course Notes:
  • Course Introduction
  • Deterministic Finite Automata
  • More Deterministic Finite Automata
  • Non-deterministic Finite Automata
  • DFA-NFA Equivalence
  • Regular Expressions
  • More Regular Expressions
  • Non-Regular Languages
  • Context-Free Grammars
  • Push-Down Automata
  • Non Context-Free Languages
  • Turing Machines
  • Turing Machine Variants
  • The Church-Turing Thesis