NPTEL Video Course : Theory of Computation


Lecture 7 - A generalization of pumping lemma, nondeterministic finite automata (NFAs), computation trees for NFAs


            


DIGIMAT Learning Management Platform