Following is a state table for a finite state machine. Each entry gives the…
PYQ GATE 1997
Following is a state table for a finite state machine. Each entry gives the next state and output.
Present state | Input 0: next state, output | Input 1: next state, output |
|---|---|---|
A | B, 1 | H, 1 |
B | F, 1 | D, 1 |
C | D, 0 | E, 1 |
D | C, 0 | F, 1 |
E | D, 1 | C, 1 |
F | C, 1 | C, 1 |
G | C, 1 | D, 1 |
H | C, 0 | A, 1 |
A. Find the equivalence partition on the states of the machine.
B. Give the state table for the minimal machine. Use appropriate names for equivalent states; for example, if X and Y are equivalent, use XY as the name of the combined state.
Sign up free to check your answer
Sign up freeLoading lesson…

