Simplification.Canonical


Back to table

/*
Logic-Function-Analysis
Simplification.Canonical

[LogicFunction g]=Simplification.Canonical(LogicFunction f);

f : a logic function
g : a logic function may in the simpler form

Simplify a logic function with the full algorithm but without removing the multi-covered logic terms.

*/
//-------------------------------------------------------------------
// examples
P=AndOr(){ 
   1,2 ; 
   -1,3 ; 
   -1,-2,3 ; 
   -1,-2,-3 ; 
   1,2,3 ; 
}
[f]=Simplification.Canonical(P);
Print(f);


//-------------------------------------------------------------------
// result





IsOneFunction IsPositiveFunction IsPositiveUnateFunctionTo binary binaryioset() ToDualFunction ToPOS DiagramGateName DigitalSystem FeedbackSystem Imply Count Nand Nor object() One POS real() Save TransitionSeries CreateCompactTable ToDigitalSystem Compatibility Canonical DontCare MultiCover TimingChart TruthTable XORP Zero

Search This Website :

 
Buy website traffic cheap