Practice over 1000+ GATE-level questions from this topic!
Designed to match the latest GATE pattern with topic-wise precision, difficulty tagging, and detailed solutions.
A finite state machine (FSM) is implemented using the D flip-flops A and B, and logic gates, as shown in the figure below. The four possible states of the FSM are 
Assume that 
is held at a constant logic level throughout the operation of the FSM. When the FSM is initialized to the state 
and clocked, after a few clock cycles, it starts cycling through
all of the four possible states if 
three of the four possible state if 
only two of the four possible states if
only two of the four possible states if
Explanation Locked!
Unlock this branch to view the explanation, track, bookmark and more.
Sign in to Unlock