MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Which of the technique can be used to prove that a language is non regular? Explanation: We use the powerful technique called Pumping Lemma, for showing certain languages not to be regular.

Detailed explanation-2: -Explanation: We use the method of proof by contradiction in pumping lemma to prove that a language is regular or not.

Detailed explanation-3: -The pumping lemma is often used to prove that a given language L is non-context-free, by showing that arbitrarily long strings s are in L that cannot be “pumped” without producing strings outside L. . This contradicts the definition of L. Therefore, our initial assumption that L is context free must be false.