CSC 54-304: Theory of Computation

Southwestern University, Spring/2025

Arjun Chandrasekhar

  • Home
  • Syllabus
  • Lecture Slides(current)
  • Lecture Notes
  • Written Assignments and Exams
  • Programming Assignments
  • Paideia Project
  • Getting Help
  • Mathematical Notation, Sets, and Proof Techniques
  • Formal Languages, Decision Problems, and Computation
  • Deterministic Finite Automata
  • DFA Closure Properties
  • Nondeterministic Finite Automata
  • Regular Expressions
  • Nonregular Languages
  • Context-free Languages
  • Pushdown Automata
  • Non-context-free Languages
  • Turing Machines
  • Turing Machine Variants
  • Turing Machine Closure Properties
  • Countability and Diagonalization
  • The Halting Problem
  • Turing Reducibility
    • make_program.py
    • one_string.py
    • even.py
  • Undecidable Languages