Which of the technique can be used to prove that a language is non regular?
Posted: Thu Jul 14, 2022 9:24 am
a) Ardens theorem
b) Pumping Lemma
c) Ogden’s Lemma
d) None of the mentioned
b) Pumping Lemma
c) Ogden’s Lemma
d) None of the mentioned