Gate CS-2015-2 Question Paper With Solutions

Q. 49 The number of states in the minimal deterministic finite automaton corresponding
to the regular expression (0 + 1) * (10) is______

(A) 2

(B) 3

(C) 4

(D) 5

Answer: (B)

Explanation:

Gate CS-2015-2 Question Paper With Solutions

Learn More:   Gate EE-2017-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here