Question

Consider the DFAs M and N given above. The number of states in a minimal DFA that accpets the language $L\left(M\right)\cap L\left(N\right)$ is

Answer 1

$L\left(M\right)=(a+b{)}^{\ast }a$ (strings ending with a)

$L\left(N\right)=(a+b{)}^{\ast }b$ (strings ending with b)

$L\left(M\right)\cap L\left(N\right)=\varphi$ (nothing in common)

$\therefore$ Number of states = 1
minimal DFA which accepts empty language,