The pumping lemma is often used to prove that a language is
2025
The pumping lemma is often used to prove that a language is
- A.
Context free
- B.
Not context free
- C.
Regular
- D.
None of the above
Attempted by 50 students.
Show answer & explanation
Correct answer: B
The pumping lemma provides a necessary condition for regularity or context-freeness. It is used to prove that a language is not regular or not context-free by showing the pumping property fails.
Explore the full course: Mppsc Assistant Professor Computer Science Paper 2
Loading lesson…