everything.study
CS 365

Models of Computation

Undergraduate

2014

Topics

  • Finite automata
  • Context-free grammars
  • Turing machines and undecidability
  • Time complexity
  • Space complexity
  • Intractability
  • Advanced topics

Readings

  • Introduction to the Theory of Computation, third edition
    third edition · typical reference
Sources