Question: Using the pumping lemma for regular languages shows that the following language is not regular. L = {a^(m) b^(m+2) | m > 0}
Using the pumping lemma for regular languages shows that the following language is not regular. L = {a^(m) b^(m+2) | m > 0}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
