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
IsBlankFunction IsMonotonicFunction IsUnateFunction IsUnateFunctionTo IsZeroFunction AndXor Binary ToBinary BCDEx3 BinaryNumberToString GrayCode StringToBinaryNumber binary bool() ToAndXor AddXorTerm ToTruthTable list() MantissaToPositiveDecimal PositiveNumberToMantissa RadixFromIndex PermutationMatrix real() To2LayerAndXor ToFullAnd BestVariableOrder DontCare Full GetPositiveLogicFunction Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.