1.

State true or false:Statement: Pumping lemma gives a necessary but not sufficient condition for a language to be regular.(a) Statement: Pumping lemma gives a necessary but not sufficient condition for a language to be regular.(b) true(c) falseI got this question in exam.I need to ask this question from Applications of Pumping Lemma/Pigeonhole principle in chapter Properties of Regular Languages of Automata Theory

Answer» CORRECT answer is (a) Statement: PUMPING lemma gives a necessary but not SUFFICIENT CONDITION for a language to be regular.

To explain: The converse of the lemma is not true. There may EXISTS some language which satisfy all the conditions of the lemma and still be non-regular.


Discussion

No Comment Found

Related InterviewSolutions