Pumping lemma for regular language is generally used for proving :
PYQ UGC NET 2017
Pumping lemma for regular language is generally used for proving :
- A.
whether two given regular expressions are equivalent
- B.
a given grammar is ambiguous
- C.
a given grammar is regular
- D.
a given grammar is not regular
Attempted by 226 students.
Sign up free to check your answer
Sign up freeLoading lesson…

