The problem of determining a simple representation for three-valued logic functions is considered. First, the given logic function is separated into two sets of terms, one for f1-type terms and the other for f2-type, and the relations between the terms are defined. The technique for finding easily the terms which have those relations is then illustrated. The superiority of the algorithm is then demonstrated by an example.
机构:
Moscow State Forest Univ, Fac Elect & Syst Engn, 1st Inst Kaya St 1, Mytishchi 141005, Moscow Reg, RussiaMoscow State Forest Univ, Fac Elect & Syst Engn, 1st Inst Kaya St 1, Mytishchi 141005, Moscow Reg, Russia
机构:
Department of Computational Mathematics and Cybernetics, Moscow State UniversityDepartment of Computational Mathematics and Cybernetics, Moscow State University