GATE CSE 2016 Set 2 | Question: 16

Question

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

Comments

substring is length 1 

so, “  n+1 “ is a formula for substring mini DFA state

n+1=1+1= 2 Ans

Answer 1

The exression will give first NFA and then has to be converted to DFA