Which of the technique can be used to prove that a language is non regular?

• A. Ardens theorem
• B. Pumping Lemma
• C. Ogden s Lemma
• D. None of the mentioned