Computer Science 4910
Introduction to Complexity Theory
September 2021

Lecture Notes

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

  9. Additional Help

Click on the link to
Last modified:Wednesday December 08, 2021 at 02:31 pm AST
Cezar Câmpeanu