Minimum-Row Primitive Flow Table: Eliminate Redundant Stable Total States
??Redundant States: Two stable total states are equivalent if:
(a) Their inputs are the same and
(b) Their outputs are the same and
(c) Their next-states are equivalent for each possible next input
In Example 1, possible candidates for combining are:
{4,5} - no, because outputs not the same
{2,6} - no, because next-states not equivalent under 11 input (states 4 and 5)
so no redundant states here.
In Example 2, possible candidates are:
{4,6} - no, different outputs
{2,5} - no, different outputs
so no redundant states here either.