Sequential.Simplification.FullTable
Back to table
/*
SequentialLogic
Sequential.Simplification.FullTable
[StateTransition result]=Sequential.Simplification.FullTable(StateTransition table);
Simplify an incompletely defined state-transition-table with the compatibility algorithm.
*/
//-------------------------------------------------------------------
// examples
//-------------------------------------------------------------------
// result
IsNegativeUnateFunctionTo IsPositiveUnateFunctionTo IsSelfDualFunction MinValue BCDEx3 PureBinary binaryioset() bool() ToDiagram ToShannonTree ToVariableInvertedFunction minterm MantissaToPositiveNumber PositiveIntegerToMantissa object To2LayerAndOr Solve ToDigitalSystem Compatibility FullTable FastVerificationData Full Shannon SimpleCover string() GetPositiveLogicFunction GetSubTable AdjustLogicVariableCount ShannonExpansion Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.