Intermediate
Theory of Computation
Q55 / 100
What is the Pumping Lemma for context-free languages?
Correct! Well done.
Incorrect.
The correct answer is B) For any CFL with pumping length p, every string w with |w|≥p can be written as uvxyz where |vy|≥1, |vxy|≤p, and uv^i xy^i z is in the language for all i≥0
B
Correct Answer
For any CFL with pumping length p, every string w with |w|≥p can be written as uvxyz where |vy|≥1, |vxy|≤p, and uv^i xy^i z is in the language for all i≥0
Explanation
The CFL Pumping Lemma splits strings into 5 parts: uvxyz with two "pumpable" segments v and y. Violating it proves a language is not context-free (e.g., {aⁿbⁿcⁿ}).
Progress
55/100