Context Free Language Question (Pumping Lemma)

Posted by Maixy on Stack Overflow See other posts from Stack Overflow or by Maixy
Published on 2010-04-08T02:12:02Z Indexed on 2010/04/08 2:43 UTC
Read the original article Hit count: 303

I know this isn't directly related to programming, but I was wondering if anyone know how to apply the pumping lemma to the following proof:

Show that L={(a^n)(b^n)(c^m) : n!=m} is not a context free language

I'm pretty confident with applying pumping lemmas, but this one is really irking me. What do you think?

© Stack Overflow or respective owner

Related posts about automata

Related posts about theory