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





IsCovering IsNegativeUnateFunctionTo IsPositiveUnateFunctionTo BDD Binary BCD NineComplement OneComplement StringToBinaryNumber TwoComplement binaryioset ToSOP Diagram DiagramGateName Dimacs Equiv logicvardef() minterm Nor Not RadixToIndex real To2LayerAndXor InputVariables CreateCompactTable ShannonTree Canonical IndependentBase ShrinkLogicFunction Zero

Search This Website :

 
Buy website traffic cheap