Q. 35 Let T be the language represented by the regular expression Σ∗0011Σ∗ where Σ = {0, 1}. What is the minimum number of states in a DFA that recognizes L’ (complement of L)?
(A) 4
(B) 5
(C) 6
(D) 8
Answer: (B)
Explanation:
Q. 35 Let T be the language represented by the regular expression Σ∗0011Σ∗ where Σ = {0, 1}. What is the minimum number of states in a DFA that recognizes L’ (complement of L)?
(A) 4
(B) 5
(C) 6
(D) 8
Answer: (B)
Explanation:
