Question

Which tool is used to prove language is not regular?​

Answer 1

Answer:

The pumping lemma is often used to prove that a particular language is non-regular: a proof by contradiction may consist of exhibiting a word (of the required length) in the language that lacks the property outlined in the pumping lemma.