Question: Use the pumping lemma for regular languages to show that the language is not regular. L = {a' (ab) (ca): 1, j>0}
Use the pumping lemma for regular languages to show that the language
is not regular.
L = {a' (ab) (ca): 1, j>0}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
