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

Answer: B. Not context free

A.
Context free
B.
Not context free
C.
Regular
D.
None of the above

Attempted by 90 students.

Show answer & explanation

Correct answer: B

Explore the full course: Mppsc Assistant Professor Computer Science Paper 2