title: Regular pumping lemma proving L={Am+n Bm C2n} is not regular
body: <p>I wanted to prove that this language is not regular L={Am+n Bm C2n} so this is what i did :</p>
  
  <p>Let m be the critical length of L and length |W|>/m</p>
  
  <p>and i picked W=A3m Bm C2m</p>
  
  <p>then from the pumping lemma i got: W=A3m Bm C2m with lengths |YZ|&lt;\m, |Y|>/1</p>
  
  <p>thus: y=Bk, 1\
  
  <p>from the pumping lemma: YZiX∈L   i=0,1,2,3...</p>
  
  <p>thus: YZ0X=ZX∈L </p>
  
  <p>thus: A3m Bk-m C2m ∉ L
       L={Am+n Bm C2n} We have here a contradiction therefore the language is not regular. IS THIS RIGHT ? or CAN YOU SHOW ME THE CORRECT SOLUTION please :D</p>