Contents (hide)
  1 1. Introduction.
  2 2. Languages and Regular Expressions.
  3 3. Regular Languages and Finite
Automata.
  4 4. Finite Automata.
  5 5. Pumping Lemma for Regular Languages.
  6 6. Equivalence Classes.
  7 7. Context Free Grammars.
  8 8. Context Free Languages and Pushdown
Automata.
  9 9. Pumping Lemma for CFL.
  10 10. Turing Machines
  11 11. Turing Machines and recursively
enumerable languages
  12 12. Reductions
  13 13. Reductions and Rice's Theorem

Practical Sessions

1. Introduction.

pdf    doc

2. Languages and Regular Expressions.

pdf    doc

3. Regular Languages and Finite Automata.

pdf    doc

4. Finite Automata.

pdf    doc

5. Pumping Lemma for Regular Languages.

pdf    doc

6. Equivalence Classes.

pdf    doc

7. Context Free Grammars.

pdf   doc

8. Context Free Languages and Pushdown Automata.

pdf   doc

Answer for the last question.

9. Pumping Lemma for CFL.

pdf   doc

10. Turing Machines

pdf   doc

11. Turing Machines and recursively enumerable languages

pdf   doc

12. Reductions

pdf   doc

13. Reductions and Rice's Theorem

pdf   doc