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 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: (D)
Explanation:
Quiz of this Question
Last Updated :
26 Apr, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...