ShannonTree.FastVerificationData
Back to table
/*
Shannon-Tree
ShannonTree.FastVerificationData
[BinaryIOSet() dataList ]=ShannonTree.FastVerificationData(LogicFunction F);
F : a logic function
dataList : a list of data-set in the form {input : output}
Generate the fast verification input-output pattern for validating a logic circuit.
The series of the results are not sorts.
*/
//-------------------------------------------------------------------
// examples
f = AndOr()
{
2,4;
1,-3;
-1,2,3;
-1,2,3,4;
-2,-4;
}
g=ShannonTree.FastVerificationData(f);
Print(f,g);
//-------------------------------------------------------------------
// result
Analysis IsBlankFunction IsSelfAntiDualFunction IsZeroFunction BCDEx3 GrayCode OneComplement binary binaryioset() bool() ToDualFunction ToVariableInvertedFunction Get logicvardef() long() MantissaToPositiveDecimal MostSignificantDigit Or Print real SOP Solve ShortestInputsForTransition StateVariables OutputAndStateBasedly StateTransitionBasedly Compatibility Balanced GetPositiveLogicFunction Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.