L6: The Pumping Lemma, and introduction to CFLs

Published: Oct. 11, 2011, 7 a.m.

b'A formal treatment of the pumping lemma for regular languages, and its use in proving that certain languages are not regular. Introduction to context free languages and grammars.'