PPT of TOC
The Introduction
Finite Automata
Regular Languages and Regular Grammars
Properties of Regular Languages
Context-Free Languages
Simplification of CFG and Normal Forms
Pushdown Automata
Properties of Context-Free Languages
Turing Machines
A Hierarchy of Formal Languages and Automata
Limits of Algorithmic Computation