Question

Prove that the following language is regular or explain why it is nonregular: L = {amb" (m is odd and n is even) OR (m is even and n is odd))

Answer 1

Now considering the problem of showing that it is given

a^mb^n such that here we can prove that it is regular and it is not nonregular

So by proof: n+m=even,

Even+Even=Even

Odd+Odd=Even

(aa)^*(bb)^*+(aa)^*.a(bb)^*.b

Then n+m =Odd;(aa)^*(bb)^*b+(aa)^*a(bb)^*b

Now we proof that it is regular and it s not nonregular