MINIMIZING LOGIC BY RESOLVING "DON'T CARE" OUTPUT VALUES IN A FINITE STATE MACHINE

Logic which implements an output encoded finite state machine is reduced by resolving "don't care" output values. Specifically, in order to generate logic for a finite state machine, input is received from a user. The input specifies states of the finite state machine, transition conditions between states and output values for each state. For example, a graphical user interface receives from the user a graphic portrayal of a state diagram. At least one output value is unspecified for at least one state. Logic for a finite state machine is generated from the user inputs. The generation includes, for each output of the finite state machine, generating an output flip-flop which stores the output. Values are assigned to unspecified output values. The assigned values are selected so that each state can be uniquely identified by current values stored by the output flip-flops and a minimum of additional flip-flops. For example, the assignment is done by determining a number of times output values between two states are identical for every combination of values for the unspecified output values. The combination of values which results in a minimum number of times output values between two states are identical is the combination of values assigned to the unspecified output values.