NPTEL Video Course : Theory of Automata, Formal Languages and Computation

Lecture 12 - Equivalence Between FSA and Type 3 Grammars