Last Updated :
14 Dec, 2018
Which of the following statements are true regarding Pumping lemma for regular languages?
- I. If a language is regular, then it always satisfies pumping lemma.
- II. If a language is satisfies pumping lemma, then it is always regular language.
- III. Pumping lemma is used to show a language is regular.
- IV. Pumping lemma is used to show a language is non-regular.
(A) I and III
(B) II and IV
(C) II and III
(D) I and IV
Answer: (D)
Explanation: Pumping lemma is for negativity test. If a language contradicts pumping lemma then it is not a regular language. If a language is satisfies pumping lemma, then it may or may not be regular language.
So, option (D) is correct.
Quiz of this Question
Share your thoughts in the comments
Please Login to comment...