written 8.3 years ago by | modified 2.7 years ago by |
Mumbai University > ELECTRO > Sem 3 > Digital Circuits and Designs
Marks: 10M
Year: Dec 2013
written 8.3 years ago by | modified 2.7 years ago by |
Mumbai University > ELECTRO > Sem 3 > Digital Circuits and Designs
Marks: 10M
Year: Dec 2013
written 8.3 years ago by |
Equivalent states are identified and merged to reduce the number of states by using the method of partitioning.
First partition consists of all the states. $P_1$ = (1, 2, 3, 4, 5, 6)
Second partition is done by observing outputs for each state and separating dissimilar output states. $P_2$ = (1, 2, 3, 4, 6) (5)
All the further partitions are done by separating states on the basis of their respective next states.
$P_3$ = (1, 2, 3)(4, 6)(5)
$P_4$ = (1, 3)(2)(4, 6)(5)
No further partitions are possible.
The states in the same partition are indistinguishable. These redundant states can be merged to reduce the number of states. Thus, 1 = 3, and 4 = 6.
Unique states are (1, 2, 4, 5)
Reduced state table is: