# UGC-NET | UGC NET CS 2016 July – III | Question 55

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.**(A)** 2**(B)** 4**(C)** 5**(D)** 6**Answer:** **(D)****Explanation:**

Quiz of this Question