0

I wanted to prove that this language is not regular L={Am+n Bm C2n} so this is what i did :

Let m be the critical length of L and length |W|>/m

and i picked W=A3m Bm C2m

then from the pumping lemma i got: W=A3m Bm C2m with lengths |YZ|<\m, |Y|>/1

thus: y=Bk, 1\

from the pumping lemma: YZiX∈L i=0,1,2,3...

thus: YZ0X=ZX∈L

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

Jacob13000x
  • 3
  • 5

0 Answers0