Sequential.Analysis.ShortestInputsForTransition
Back to table
/*
SequentialLogic
Sequential.Analysis.ShortestInputsForTransition
[binary() result]=Sequential.Analysis.ShortestInputsForTransition(StateTransition table, var() stateXY);
Compute the shortest inputs for transition from state x to y.
*/
//-------------------------------------------------------------------
// examples
//-------------------------------------------------------------------
// result
PermuteLogicFunction IsBlankFunction IsCovering IsEqual IsPositiveUnateFunctionTo IsUnateFunctionTo BCD binaryioset ToOrAnd Load long Nand NumberSystem MantissaToPositiveDecimal MostSignificantDigit RadixFromIndex One PermutationMatrix To2LayerOrAnd Save Assign OutputAndStateBasedly Implementation ShannonTree Fast StateDeviceName CreateFromLogicFunctions GetNegativeLogicFunction ShannonExpansion Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.