Computer Science/Math 491A
Introduction to Complexity Theory
SEPTEMBER 2016

Lecture Notes

  1. Mathematical Review
  2. Basic Concepts and Notations
  3. Finite Automata (DFAs/NFAs)
  4. Regular Expressions
  5. Properties of Regular Languages
  6. Rewriting Systems
  7. Properties of Context Free Languages
  8. Decidability and Computability, and Complexity

Last modified:Tuesday September 12, 2017 at 02:09 am ADT
Cezar Câmpeanu