Contents (hide)

Practical Sessions

1. Introduction.

pdf    doc

2. Languages and Regular Expressions.

pdf    doc

3. Regular Languages and Finite Automata.

pdf    doc

4. Finite Automata.

doc    pdf

5. Pumping Lemma for Regular Languages.

pdf    docx

6. Equivalence Classes.

pdf    docx

7. Context Free Grammars.

docx   pdf

8. Context Free Languages and Pushdown Automata.

pdf   docx
Answer for question 3.

9. Pumping Lemma for CFL.

pdf   doc

10. Turing Machines

pdf   doc

11. Turing Machines and recursively enumerable languages

pdf   docx

12. Reductions

pdf   docx

13. Reductions and Rice's Theorem

pdf   doc