Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops.
simulate this circuit β Schematic created using CircuitLab
The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of βinβ is _.
My question is how can we calculate a number of states in above diagram. Is there any formulae for that or any logic to calculate?
Best Answer
Two FFs can be in a total of 22 = 4 states altogether. An appropriate pattern of bits on
Input
can drive the machine to any given state.However, the actual question is more subtle than that: How many states can make a transition to a particular state?
The serial connection between the FFs implies that there's a limitation β what is it?