NPTEL Video Course : Theory of Computation


Lecture 22 - Parse trees, inductive proof that L is L(G). All regular languages are context free


            


DIGIMAT Learning Management Platform