Possible Duplicate:
How to prove that a language is not regular?
Show that $L_2=\{a^nb^k|n\not= k-1\}$ is not regular by Pumping Lemma.
Asked
Active
Viewed 56 times
0
-
Or actually showing by any method is fine. – Dash Oct 31 '12 at 05:13
-
Welcome! Please check our reference question. If you can't get any of the approaches to work, please include your attempts here and flag for reopening. – Raphael Oct 31 '12 at 06:36