Let $L$ be the language generated by regular expression $0^*10^*$ and accepted by the deterministic finite automata $M$. Consider the relation $R_M$ defined by $M$. As all states are reachable from the start state, $R_M$ has ________ equivalence classes.
My Try:
If we draw the DFA for this language then it will have $3$ state, where one is final state and two are non-final states. Then answer should be $3$.
But, official answer is given $6$.
Can you please explain ?