everything.study
LE/EECS 2001

Introduction to the Theory of Computation

3.0 credits

Winter 2026

Topics

  • Automata
  • formal languages
  • computation models
  • computability
  • mathematical proofs
  • limits of computation

Readings

  • Listed text: Sipser, Introduction to the Theory of Computation, 3rd ed.
  • References: Rosen, Discrete Mathematics and Its Applications; Du and Ko, Problem Solving in Automata, Languages, and Complexity; Hammack, Book of Proof; Hopcroft, Motwani and Ullman, Introduction to Automata Theory, Languages and Computation, 3rd ed.; Martin, Introduction to Languages and the Theory of Computation; Rich, Automata, Computability and Complexity; Solow, How to Read and Do Proofs, 6th ed.; Wohlgemuth, Introduction to Proof in Abstract Mathematics.
Sources