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





IsInverse IsMonotonicFunction IsThresholdFunction And AndOr BDD ToAndOr ToBinary ToAndXor ToPOS ToROBDD DiagramGateName Count LogicScript logicvardef long minterm() Nand RadixToIndex Or To2LayerNand StateVariables GetExcitationTable ToDigitalSystem BestVariableOrder Fast MultiCover StateTransition string Zero

Search This Website :

 
Buy website traffic cheap