Question: Use the pumping lemma to prove language Lis not regular: La = {123 : n >0}

Use the pumping lemma to prove language Lis not regular: La = {1"2"3" : n >0}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
