Why do we use pumping lemma to prove the non-regularity of languages? WHY?

Question

I am currently working on the usage of pumping lemma and I need to know why do we use pumping lemma? the main question asked is why? I know we can prove the non-regularity and I know the formula/proof as well, I'd just like to ask why?

Not sure why this was tagged [regex]. Please only use tags that are relevant to the problem at hand. — 41686d6564 stands w. Palestine, Nov 14 '20 at 16:16

score 1 · Accepted Answer · answered Nov 14 '20 at 16:21

1

We use the Pumping Lemma IFF we can use it, because in those cases where we can use it, it provides much shorter and simpler proofs than other alternative proof methods.

answered Nov 14 '20 at 16:21

Jörg W Mittag

363,080
75
446
653

Why do we use pumping lemma to prove the non-regularity of languages? WHY?

1 Answers1