Say if the language is context-free or not. If it is, write a context-free grammar, if not, demonstrate using the pumping lemma. $L=\{a^{n+3}b^{2m}|n≠m\}$
I have seen a lot of examples using the context-free pumping lemma, but none of them have the requirement of n≠m. I can't think of any demonstration for this one. If anybody has any idea, it would be great to hear it. Thanks.
Perhaps it is context-free? If it is, you intuitively need to have two derivation paths, one for $n > 2m-3$ and one for $n < 2m-3$. Can you figure each one out?