GATE | CS | 2016 | Set 2 | TOC | Finite Automata | Question 26

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]