Determination of the minimization algorithm of the logical function with dependent parameters
Annotations languages:
Description: Let’s consider minimization algorithm which sums up logical function, most meanings of which are equal to zero, one and dependent parameters based on splitting most meanings being crossed submitting containing two meanings with common element of crossing equal to zero.
Reference:
Korobkov, N.G. and Korobkova, E.N. (2002), “Razrabotka algoritma minimizatsii obobshchennykh logicheskikh funktsii s zavisimymi parametrami”, Information Processing Systems, Vol. 2(18), pp. 225-230.
Korobkov, N.G. and Korobkova, E.N. (2002), “Razrabotka algoritma minimizatsii obobshchennykh logicheskikh funktsii s zavisimymi parametrami”, Information Processing Systems, Vol. 2(18), pp. 225-230.