Sequential.Simplification.Compatibility
Back to table
/*
SequentialLogic
Sequential.Simplification.Compatibility
[StateTransition result]=Sequential.Simplification.Compatibility(StateTransition table);
Simplify an incompletely defined state-transition-table with the compatibility algorithm.
*/
//-------------------------------------------------------------------
// examples
//-------------------------------------------------------------------
// result
Advanced PermuteLogicFunction IsLinearFunction IsSelfAntiDualFunction IsSymmetricFunctionTo BinaryNumberToString OneComplement TwoComplement binaryioset() ToAndXor ToOrAnd ToTruthTable list() Count minterm() Nor NumberSystem PositiveNumberToMantissa Radixes RadixFromIndex To2LayerOrAnd MaxSAT Save Balanced StateTransition string() TimingChart GetNegativeLogicFunction var Zero