Simplification.Full
Back to table
/*
Logic-Function-Analysis
Simplification.Full
[LogicFunction g]=Simplification.Full(LogicFunction f);
f : a logic function
g : a logic function may in the simpler form
Simplify a logic function with the full algorithm.
*/
//-------------------------------------------------------------------
// examples
P=AndOr(){
1,2 ;
-1,3 ;
-1,-2,3 ;
-1,-2,-3 ;
1,2,3 ;
}
[f]=Simplification.Full(P);
Print(f);
//-------------------------------------------------------------------
// result
Analysis IsInverse IsLinearFunction IsNegativeUnateFunctionTo IsSelfDualFunction IsSymmetricFunctionTo ToBinary NineComplement binaryioset() ToNotFunction DigitalSystem Email Equiv FeedbackSystem Imply long minterm object() One Or ShortestInputsForTransition Forwardly StateTransitionBasedly CreateCompactTable ShannonTree GetNegativeLogicFunction RandomGenerate CreateDummyLogicFunction var() Zero