Lecture Notes

1. Lecture 1: Preliminaries.
2. Lecture 2: Finite automata and regular expressions.
3. Lecture 3: Finite automata with e-transitions, equivalence of FA and REs.
4. Lecture 4: Laws for REs, pumping lemma and closure properties for regular languages.
5. Lecture 5: Decision problems for regular languages.
6. Lecture 6: Context-free languages.
7. Lecture 7: Push-down automata.
8. Lecture 8: Equivalence of CFGs and PDAs.
9. Lecture 9: CFG simplification and pumping lemma for CFLs.
10. Lecture 10: Closure properties and decision problems for CFLs.
11. Lecture 11: Turing machines.
12. Lecture 12: Turing machine programming and variations.
13. Lecture 13: Recursive and recursively-enumerable languages and undecidability.
14. Lecture 14: Post's correspondence problem and other undecidable problems.
15. Lecture 15: P, NP and NP-completeness.
16. Lecture 16: NO-complete problems and other complexity classes.