CSC 54-304: Theory of Computation

Southwestern University, Spring/2025

Arjun Chandrasekhar

  • Home
  • Syllabus
  • Lecture Slides
  • Lecture Notes(current)
  • Written Assignments and Exams
  • Programming Assignments
  • Paideia Project
  • Getting Help
  • Regular Languages and Finite Automata
  • Regular Expressions
  • Non-Regular Languages
  • Context-free languages
  • Chomsky Normal Form
  • Pushdown Automata
  • Non-context-free Languages
  • Turing Machines
  • Turing Machine Variants
  • Recursively Enumerable Languages
  • Turing Machine Closure Properties
  • Turing Decidable Languages
  • Countability and Diagonalization
  • The Halting Problem
  • Turing Reductions and Undecidability
  • Mapping Reductions
  • The Recursion Theorem