Question 8118 – Theory-of-Computation

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_________.

Correct Answer: A

The regular expression generates the min string “0” or “1” and then any number of 0’s and 1’s .
So, the DFA has two states.