Q. 26 The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0+1)*(0+1)(0+1)* is __________________
(A) 2
(B) 3
(C) 4
(D) 5
Answer: (A)
Explanation:
Q. 26 The number of states in the minimum sized DFA that accepts the language defined by the regular expression (0+1)*(0+1)(0+1)* is __________________
(A) 2
(B) 3
(C) 4
(D) 5
Answer: (A)
Explanation:
