Q49

Consider a finite state machine (FSM) with one input $X$ and one output $f$, represented by the given state transition table. The minimum number of states required to realize this FSM is _______. (Answer in integer).

$$\overset{\Large{\text{Present state Next state Output f}}}{\begin{array}{|c|c|c|c|c|c|} \hline \text{ $\qquad\qquad\qquad$} & \text{X=0} & \text{X=1} & \text{X=0} & \text{X=1} \\ \hline \text{A} & \text{F} & \text{B} & \text{0} & \text{0} \\ \hline \text{B} & \text{D} & \text{C} & \text{0} & \text{0} \\ \hline \text{C} & \text{F} & \text{E} & \text{0} & \text{0} \\ \hline \text{D} & \text{G} & \text{A} & \text{1} & \text{0} \\ \hline \text{E} & \text{D} & \text{C} & \text{0} & \text{0} \\ \hline \text{F} & \text{F} & \text{B} & \text{1} & \text{1} \\ \hline \text{G} & \text{G} & \text{H} & \text{0} & \text{1} \\ \hline \text{H} & \text{G} & \text{A} & \text{1} & \text{0} \\ \hline \end{array}}$$