| 0 |
Introduction |
|
| 1 |
Mathematical Preliminaries and Notations |
|
| 2 |
Finite Automata |
|
| 3 |
Regular Languages and Regular Grammars - I |
|
| 4 |
Regular Languages and Regular Grammars - II |
|
| 5 |
Properties of Regular Languages - I |
|
| 6 |
Properties of Regular Languages - II |
|
| 7 |
Context Free Languages - I |
|
| 8 |
Context Free Languages - II |
|
| 9 |
Simplification of Context Free Grammars and Normal Forms - I |
|
| 10 |
Simplification of Context Free Grammars and Normal Forms - II |
|
| 11 |
Simplification of Context Free Grammars and Normal Forms - III |
|
| 12 |
Pushdown Automata - I |
|
| 13 |
Pushdown Automata - II |
|
| 14 |
Pushdown Automata - III |
|
| 15 |
Properties of Context Free Languages - I |
|
| 16 |
Properties of Context Free Languages - II |
|
| 17 |
Turing Machines - I |
|
| 18 |
Turing Machines - II |
|
| 19 |
Other Models of Turing Machines |
|
| 20 |
Limits of Algorithmic Computation |
|