| 1 | Introduction | PDF unavailable |
| 2 | Alphabet, Strings, Languages | PDF unavailable |
| 3 | Finite Representation | PDF unavailable |
| 4 | Grammars (CFG) | PDF unavailable |
| 5 | Derivation Trees | PDF unavailable |
| 6 | Regular Grammars | PDF unavailable |
| 7 | Finite Automata | PDF unavailable |
| 8 | Nondeterministic Finite Automata | PDF unavailable |
| 9 | NFA <=> DFA | PDF unavailable |
| 10 | Myhill-Nerode Theorem | PDF unavailable |
| 11 | Minimization | PDF unavailable |
| 12 | RE => FA | PDF unavailable |
| 13 | FA => RE | PDF unavailable |
| 14 | FA <=> RG | PDF unavailable |
| 15 | Variants of FA | PDF unavailable |
| 16 | Closure Properties of RL | PDF unavailable |
| 17 | Homomorphism | PDF unavailable |
| 18 | Pumping Lemma | PDF unavailable |
| 19 | Simplification of CFG | PDF unavailable |
| 20 | Normal Forms of CFG | PDF unavailable |
| 21 | Properties of CFLs | PDF unavailable |
| 22 | Pushdown Automata | PDF unavailable |
| 23 | PDA <=> CFG | PDF unavailable |
| 24 | Turing Machines | PDF unavailable |
| 25 | Turing Computable Functions | PDF unavailable |
| 26 | Combining Turing Machines | PDF unavailable |
| 27 | Multi Input | PDF unavailable |
| 28 | Turing Decidable Languages | PDF unavailable |
| 29 | Varients of Turing Machines | PDF unavailable |
| 30 | Structured Grammars | PDF unavailable |
| 31 | Decidability | PDF unavailable |
| 32 | Undecidability1 | PDF unavailable |
| 33 | Undecidability2 | PDF unavailable |
| 34 | Undecidability3 | PDF unavailable |
| 35 | Time Bounded Turing Machines | PDF unavailable |
| 36 | P and NP | PDF unavailable |
| 37 | NP-Completeness | PDF unavailable |
| 38 | NP-Complete Problems1 | PDF unavailable |
| 39 | NP-Complete Problems2 | PDF unavailable |
| 40 | NP-Complete Problems3 | PDF unavailable |
| 41 | Chomsky Hierarchy | PDF unavailable |