Question 6788 – Theory-of-Computation

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.

Correct Answer: D