# FA18:Lecture 23 Pumping lemma

From CS2800 wiki

We finished the proof that the union of recognizable languages is recognizable and then proved that [[Claim:{0^n1^n} is unrecognizable]], both directly and using the pumping lemma.

- This page was last edited on 21 October 2018, at 16:21.