Guidelines for State Assignment
? The idea of the following heuristics is to try to get the 1's together (in the same implicant) on the flip-flop input maps. This method does not apply to all problems and even when it is applicable it does not guarantee a minimum soultion.
??States which have the same next state, for a given input, should be given adjacent assignments ("fan-out oriented").
??States which are the next states of the same state should be given adjacent assignments ("fan-in oriented").
??Third priority, to simplify the output function, states which have the same output for a given input should be given adjacent assignments (this will help put the 1's together in the output K-maps; "output oriented").