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
MatchLogicFunction IsLinearFunction IsParityFunction IsSymmetricFunctionTo AndXor binary() AbsoluteExpression bool ToPOS DiagramGateName Equiv LogicScript minterm() Nand Radixes RadixToIndex OrAnd Print Realization To2LayerNor To2LayerAndOr ToFeedbackSystem Compatibility HuffmanMealy FastVerificationData RandomGenerate Utility ComputeDONTCARE IndependentBase Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.