GATE Papers >> CSE >> 2009 >> Question No 27

Question No. 27 CSE | GATE 2009

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

Present State A Present State B Input Next State A Next State B Output
0 0 0 0 0 1
0 1 0 1 0 0
1 0 0 0 1 0
1 1 0 1 0 0
0 0 1 0 1 0
0 1 1 0 0 1
1 0 1 0 1 1
1 1 1 0 0 1

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?


Answer : (A) 3


Comments
cOTB4i http://pills2sale.com/ cheap viagra

Posted on  08/10/2020 15:18:47  by  dobson
9RJQ0R http://pills2sale.com/ levitra nizagara

Posted on  18/10/2020 15:32:13  by  dobsonz
59XrxE http://pills2sale.com/ levitra nizagara

Posted on  18/10/2020 19:30:00  by  dobsonz
4EV3VU http://pills2sale.com/ viagra cialis buy

Posted on  01/11/2020 20:09:04  by  johnanx
Leave a comment