 | LAST REQUEST |
You are not logged in.
PREVIOUS CALCULATION REQUEST:
/*
Logic-Function-Analysis
Simplification.Full
[LogicFunction g]=Simplification.Full(LogicFunction f);
f : a logic function
g : a logic function may in the simpler form
Simplify a logic function with the full algorithm.
*/
//-------------------------------------------------------------------
// examples
P=AndOr(){
1,2 ;
-1,3 ;
-1,-2,3 ;
-1,-2,-3 ;
1,2,3 ;
}
[f]=Simplification.Full(P);
Print(f);
//-------------------------------------------------------------------
// result
PREVIOUS CALCULATION RESULT:
/*
Logic-Function-Analysis
Simplification.Full
[LogicFunction g]=Simplification.Full(LogicFunction f);
f : a logic function
g : a logic function may in the simpler form
Simplify a logic function with the full algorithm.
*/
//-------------------------------------------------------------------
// examples
P=AndOr(){
1,2 ;
-1,3 ;
-1,-2,3 ;
-1,-2,-3 ;
1,2,3 ;
}
[f]=Simplification.Full(P);
Print(f);
//-------------------------------------------------------------------
// result
IsBiUnateFunctionTo IsCovering IsEqual IsOneFunction AndOr FromBinary MaxValue ToBinary TwoComplement bool() ToPOS ToROBDD ToXORP DiagramGateName ExcitationTable Not Radixes real() Sequential ShannonTree Full MultiCover Shannon string GetPositiveLogicFunction Utility ShrinkLogicFunction var Xor Zero