Multiple choice

Pumping lemma is generally used for proving

  1. a given grammar is regular

  2. a given grammar is not regular

  3. whether two given regular expressions are equivalent or not

  4. none of these

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

The Pumping Lemma is a proof technique used to show that a language is not regular by demonstrating that it fails the conditions required for regular languages.