GATE | GATE-CS-2016 (Set 2) | 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]

(A)

2

(B)

3

(C)

4

(D)

5

Answer: (A)

Explanation:

According to regular expression, automata do not accept null characters (lambda). As it says (0+1)*(0+1)(0+1)*. So here both the (0+1)* can be null. But we will still have one (0+1). So, the minimum number of states is 2. Thus, B is the correct answer. 

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save