Given the following state table of an FSM with two states A and B, one input…
GATE · 2009 · CS
Given the following state table of an FSM with two states A and B, one input and one output:
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
Attempted by 72 students.
Sign up free to check your answer
Sign up freeLoading lesson…