In Pumping Lemma for regular languages, to say a language is satisfying…

PYQ UGC NET 2022

In Pumping Lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of ' y ' if you consider the string as ' xyz '.

  1. A.

    n

  2. B.

    2

  3. C.

    1

  4. D.

    0

Attempted by 159 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…