title: Proving that a language is not a context free using pumping lemma?
body: <p>I am trying to prove that the language L = {a^n! | n>=0} is not context free using pumping lemma. But i am stuck at how to divide into uvxyz itself. Since its only one symol i find it very tricky.</p>