****** C) by inspection
9.7 Reduce the number of states of the following sequential circuit: (a) By partitioning. (b) Using
an implication table. (c) By inspection.
Solution
BY inspection :
For two states to be equivalent,
i)the present outputs should be same
ii)the next states should be same
we can see that states B and C have the same outputs 0 0 1 for input combinations.
the next states are D E C and A E B
lets suppose B and C are equivalent... this is true only if A and D are equivalent.
for states A and D ouputs are same i.e 1 0 1
next staes are D C E and A B E
we can see that A and D are equivalent if B and C are equivalent.
So B and C are equivalent and A and D are equivalent.
so the replace C with B and D with A
no more reduction is possible.
I J K
A A/1 B/0 E/1

B A/0 E/0 B/1
E A/1 B/0 B/1