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 requ

Question

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)
State: A, next(X=0)=F, next(X=1)=B, f(X=0)=0, f(X=1)=0
State: B, next(X=0)=D, next(X=1)=C, f(X=0)=0, f(X=1)=0
State: C, next(X=0)=F, next(X=1)=E, f(X=0)=0, f(X=1)=0
State: D, next(X=0)=G, next(X=1)=A, f(X=0)=1, f(X=1)=0
State: E, next(X=0)=D, next(X=1)=C, f(X=0)=0, f(X=1)=0
State: F, next(X=0)=F, next(X=1)=B, f(X=0)=1, f(X=1)=1
State: G, next(X=0)=G, next(X=1)=H, f(X=0)=0, f(X=1)=1
State: H, next(X=0)=G, next(X=1)=A, f(X=0)=1, f(X=1)=0

Accepted Answer

5

Related Digital Logic PYQs

Turn practice into measurable progress