Question 8413 – Theory-of-Computation

Let L be the language represented by the regular expression Σ*0011Σ* where Σ = {0,1}. What is the minimum number of states in a DFA that recognizes (complement of L)?

Correct Answer: B

No. of states in DFA accepting L and complement of L is same. So let’s draw minimal DFA for L,

So, 5 states are there.