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 __________________
[Note that this question was originally asked as Fill-in-the-Blanks type]
So, the minimum number of states is 2.
Thus, B is the correct answer.
Quiz of this Question