A finite state machine with the following state table has a single input x and…
GATE · 1995 · CS · Question 2 subparts
A finite state machine with the following state table has a single input x and a single output z.
present state | next state, z (x=1) | next state, z (x=0)
A | D,0 | B,0
B | B,1 | C,1
C | B,0 | D,1
D | B,1 | C,0If the initial state is unknown, then the shortest input sequence to reach the final state C is:
- A.
01
- B.
10
- C.
101
- D.
110
Attempted by 3 students.
Sign up free to check your answer
Sign up freeLoading lesson…