L={ambncn:m,n1}{bmcn:m,n0} No need to write this down but L actually satisfies the pumping lemma for regular languages. Show that L is not regular. (Given the earlier comment one can not hope to prove this by showing that L violates the pumping lemma. Try to use LM in your proof where M={abmcn:m,n0}.)