Question

which of the technique can be used to prove that a language is non regular? select one: a. pumping lemma b. ogdens lemma c. none of the mentioned d. ardens theorem

Answer 1

Technique that is  used to prove that a language is Non regular is: (a) Pumping Lemma.

Step-by-step explanation:

As the  pumping lemma is used to prove the language as a non regular Thus, if a language is regular, it always satisfies pumping lemma

Whereas Baba Arden theorem  converts DFA to regular expression as well as used to check equivalence of two regular Expression.

Also the Ogdens lemma is used to prove that a language is Context free or not

so the correct answer is  Pumping Lemma