The Student Room Group

Help with Regular Languages

I'm trying to prove that the following languages aren't regular, but I'm struggling. I'm attempting proof by showing they do not follow the pumping lemma (i.e. assuming that they do and finding a contradiction)

L= a^n b^m with n not equal to m
&
K= any word w in (a,b)* such that w is not a palindrome

Thanks for any help
Reply 1
Found the answer myself.
http://www.slideshare.net/issbp/class6
Near the end of the slideshow they prove the 1st.
Choosing w = a^n b a^m means that the second will follow from the 1st.

Quick Reply

Latest

Trending

Trending