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
IsBiUnateFunction IsBiUnateFunctionTo IsEqual IsPositiveFunction IsSelfAntiDualFunction IsUnateFunction IsZeroFunction AbsoluteExpression NineComplement PureBinary Convert ToDualFunction Load LogicScript long RadixToIndex object One To2LayerNand SAT TransitionSeries Forwardly OutputAndStateBasedly ToFeedbackSystem ShannonTree Canonical GetDontCareLogicFunction ComputeDONTCARE ShannonExpansion Zero