Intermediate
Theory of Computation
Q41 / 100
What is the Pumping Lemma for regular languages used for?
Correct! Well done.
Incorrect.
The correct answer is B) Proving that a language is NOT regular by contradiction
B
Correct Answer
Proving that a language is NOT regular by contradiction
Explanation
The Pumping Lemma states that every regular language has a pumping length p such that any string w with |w|≥p can be split as xyz with xy^i z in the language. Violating this proves non-regularity.
Progress
41/100