The number of states in the minimum sized DFA that accepts the language…

PYQ GATE 2016

The number of states in the minimum sized DFA that accepts the language defined by the regular expression

(0+1)∗(0+1)(0+1)∗(0+1)^∗ (0+1)(0+1)^∗

is ___________ .

Attempted by 231 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…