TOC DFA

Question

IF a language L(M) over a Σ={a,b} accepts strings ending with b. Language L(N) over a Σ={a,b} accepts strings ending with a.

Then what is minimal DFA for L(M) Ո L(N) ?

Answer 1

The minimal DFA will be one in which there is only one start state and no final state as the language generated by the L(M) $\bigcap$ L(N) will be $\phi$.

L(M) = {b, bb, ab.......}

L(N) = {a, ba, aa,......}

L(M) $\bigcap$ L(N) = $\phi$