Gate CS-2014-1 Question Paper With Solutions

Q. 26 Consider the finite automation in the following figure. What is the set of reachable states for the input string 0011?

Gate CS-2014-1 Question Paper With Solutions

(A) {q,q1,q2}

(B) {q,q1}

(C){q,q1,q2,q3}

(D) {q3}

Answer: (A)

Explanation:

Gate CS-2014-1 Question Paper With Solutions

Learn More:   Gate EE-2004 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here