🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Pumping Lemma and Minimisation: all 10 questions

Quiz: Pumping Lemma and Minimisation · Question 3 of 10

What can the pumping lemma for regular languages prove?

What can the pumping lemma for regular languages prove?

  1. A.That a language is regular
  2. B.That a language is not regular
  3. C.That a language is context-free
  4. D.The minimal number of states
Answer & explanation

Correct answer: That a language is not regular

Satisfying the pumping conditions doesn't guarantee regularity.

Can you get the rest right without peeking?

Take the timed Quiz: Pumping Lemma and Minimisation quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →