Given two languages : L1 = {(ab)n ak | n > k, k ≥ 0} L2 = {an bm | n ≠ m}…
PYQ UGC NET 2014
Given two languages :
L1 = {(ab)n ak | n > k, k ≥ 0}
L2 = {an bm | n ≠ m} Using pumping lemma for regular language, it can be shown that
- A.
L1 is regular and L2 is not regular.
- B.
L1 is not regular and L2 is regular.
- C.
L1 is regular and L2 is regular.
- D.
L1 is not regular and L2 is not regular.
Attempted by 104 students.
Sign up free to check your answer
Sign up freeLoading lesson…

