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 IsBiUnateFunction IsPositiveFunction IsSymmetricFunction BDD ToAndOr GrayCode NineComplement PureBinary ToROBDD ToShannonTree ToSOP ToXORP Equiv Minus SOP To2LayerAndOr SAT Assign InputVariables CreateCompactTableWithFullSimplification Canonical StateTransition string() TruthTable Utility AdjustLogicVariableCount Substitute Xor Zero