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
IsMonotonicFunction IsNegativeUnateFunctionTo NineComplement OneComplement TwoComplement binary binaryioset AddXorTerm ToTruthTable ToVariableInvertedFunction ToXORP Diagram Eq Count minterm MantissaToPositiveDecimal To2LayerAndOr StateTransitionBasedly ToStateTransitionTable GetExcitationTable ShannonTree DontCare Full string() GetPositiveLogicFunction ComputeFunctionOrder IndependentBase SemanticEval var Zero