I saw this question, and was curious as to what the pumping lemma was (Wikipedia didn\'t help much).
I understand that it\'s basically a theoretical p
This is not an explanation as such but it is simple. For a^n b^n our FSM should be built in such a way that b must know the number of a's already parsed and will accept the same n number of b's. A FSM can not simply do stuff like that.