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?

  1. A.

    It applies to all regular language

  2. B.

    It applies only to infinite regular languages

  3. C.

    It applies to all context-free languages

  4. D.

    It applies to all recursively enumerable languages

Attempted by 156 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…