1.

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has _____ equivalence classes.(A) 2(B) 4(C) 5(D) 6

Answer»


Discussion

No Comment Found

Related InterviewSolutions