Pumping lemma Summary DFAs, NFAs, regular expressions are all equivalent Proving language is not regular by Pumping lemma and closure property Context Free Grammers