Question: Use pumping lemma to prove that the language is regular or not. A = {w | w = (000) n (111) n , n >
Use pumping lemma to prove that the language is regular or not.
A = {w | w = (000)n(111)n, n > 0}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
