Pumping lemma for regular language is generally used for proving :

PYQ UGC NET 2017

Pumping lemma for regular language is generally used for proving :

  1. A.

    whether two given regular expressions are equivalent

  2. B.

    a given grammar is ambiguous

  3. C.

    a given grammar is regular

  4. D.

    a given grammar is not regular

Attempted by 226 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…