Gate CS-2009 Question Paper With Solutions

Q. 54 Given the following state table of an FSM with two states A and B, one input
and one output :

Gate CS-2009 Question Paper With Solutions

 

If the initial state is A = 0,B = 0, what is the minimum length of an input string
which will take the machine to the state A = 0,B = 1 with Output= 1 ?

(A) 3

(B) 4

(C) 5

(D) 6

Answer: (A)

Explanation:

Gate CS-2009 Question Paper With Solutions Gate CS-2009 Question Paper With Solutions Gate CS-2009 Question Paper With Solutions

Learn More:   Gate EC-2011 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here