Which of the following is TRUE about the Pumping Lemma for regular language?
PYQ UGC NET 2024
Which of the following is TRUE about the Pumping Lemma for regular language?
- A.
It applies to all regular language
- B.
It applies only to infinite regular languages
- C.
It applies to all context-free languages
- D.
It applies to all recursively enumerable languages
Attempted by 156 students.
Sign up free to check your answer
Sign up freeLoading lesson…

