布尔代数中的积和范式  

The Sum of Products Normal Form in Boolean Algebra

作　　者：薛朝奎[1] 

机构地区：[1]毕节学院数学系,贵州毕节551700

出　　处：《毕节学院学报（综合版）》2007年第4期38-40,共3页Journal of Bijie University

摘　　要：研究了布尔代数中求积和范式与和积范式的方法,证明了:α(x)=[α(0)*x′]+[α(1)*x]和α(x1,x2,…,xn)=1∑1 a1=0 1∑1 a2=0…1∑1 an=0[α(a1,a2,…,na)*X1a1*X2a2*…*Xnan]通过实例验证,此法在计算时思路清晰,大大提高了求解此类问题的计算效率。The methods to solve the sum of products normal form and products of sum normal form in Boolean algebra are studied, they have been proved in α（x）=[α（0）＊x′]＋[α（1）＊x]and α（x1,x2,…,xn）=1∑1 a1=0 1∑1 a2=0…1∑1 an=0[α（a1,a2,…,na）＊X1a1＊X2a2＊…＊Xnan]. Through the case validation, it is discovered that in solution this method had clear thoughts and greatly calculation efficiency of solving this kind of problems.

关 键 词：极小项 极大项 布尔代数 范式 对偶原理 

分 类 号：O158[理学—数学]