Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2016 (Set 2) | Question 26
  • Last Updated : 13 Feb, 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)* is __________________

[Note that this question was originally asked as Fill-in-the-Blanks type]
(A) 2
(B) 3
(C) 4
(D) 5

Answer: (A)

Explanation: 2016-2-26


So, the minimum number of states is 2.
Thus, B is the correct answer.

Quiz of this Question


My Personal Notes arrow_drop_up
Recommended Articles
Page :