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 T\’ (complement of T)?
(A)
4
(B)
5
(C)
6
(D)
8
Answer: (B)
Explanation:
DFA for language represented by the regular expression Σ∗0011Σ∗ where Σ = {0, 1} is as following below: The complement of above DFA will have same number of states but there will be non-final states to final states and final state to non-final state. So, option (B) is correct.
Quiz of this Question
Please comment below if you find anything wrong in the above post