Theory of Computation Lecture Notes

1. introduction
2. string-theory
3. deterministic-finite-automata
4. declarative-models-of-computation
5. closure-of-language-classes-under-set-operations
6. equivalence-of-models
7. proving-problems-are-not-solvable-in-a-model-of-computation
8. turing-machines
9. efficient-solution-of-problems-the-class-p
10. efficient-verification-of-solutions-the-class-np
11. undecidability