GATEverse — GATE CSE previous year questions

Following is a state table for time finite state machine.

\begin{array}{|c|ll|}\hline \textbf{Present State} & \textbf{$\qquad\qquad\quad$Next State Output} \\ & \textbf{Input- 0} & \textbf{Input-1} \\\hline \text{A} & \text{B.1} & \text{H.1} \\ \text{B} & \text{F.1} & \text{D.1} \\ \text{C} & \text{D.0} & \text{E.1} \\ \text{D} & \text{C.0} & \text{F.1} \\ \text{E} & \text{D.1} & \text{C.1} \\ \text{F} & \text{C.1} & \text{C.1} \\ \text{G} & \text{C.1} & \text{D.1} \\ \text{H} & \text{C.0} & \text{A.1} \\\hline \end{array}

(A)

Find the equivalence partition on the states of the machine.

(B)

Give the state table for the minimal machine. (Use appropriate names for the equivalent states. For example if states $X$ and $Y$ are equivalent then use $XY$ as the name for the equivalent state in the minimal machine).