Question

5: Given two languages: L1 = {(ab) n ak|n>k, k 2 0}
L2 = {an bm| n = m} Using pumping lemma for regular
language, it can be shown that
2932233945
L1 is not regular and L2 is regular.
L1 is not regular and L2 is not regular.
L1 is regular and L2 is not regular.
L1 is regular and L2 is regular.
Save & Next
Save & Back​

Answer 1

Answer:

please write the question properly and ask for question ka answer modi ji ko patr in English language along with synonyms and antonyms of the