Question: Show that the following languages are not regular using Pumping Lemma. L1 = { a^n b^l : | n l | = 2 }, =
Show that the following languages are not regular using Pumping Lemma. L1 = { a^n b^l : | n l | = 2 },
= {a, b}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
