I don't think it's a CFL, but I'm having a hard time using the pumping lemma to prove this. Is there any way I can use homomorphism? Maybe h(a)= a, h(b) = lambda... If the pumping lemma is more appropriate then maybe... let m = constant of pumping lemma for some string w = a^nb^k let w =xyz such that |xy|<=m and |y|>=1 let y =a^i for some i<=k^2 then I'm completely lost... It would be greatly appreciated if someone could kindly help me with this one.

  • $\begingroup$ should i be pumping up or down? I tried down but cant get anything that makes sense $\endgroup$
    – emrb99
    Commented Dec 18, 2022 at 11:31
  • $\begingroup$ It seems you are using the pumping lemma for regular languages, not for context-free languages. $\endgroup$
    – Nathaniel
    Commented Dec 19, 2022 at 10:50


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.