布尔函数基本乘积项一致运算的二叉树表示  

On Binary Tree Representation of Consensus Operation for Fundamental Boolean Conjunctions

作　　者：罗守山[1] 杨义先[2] 阮传概[2] 

机构地区：[1]北京邮电大学基础科学部 [2]北京邮电大学信息工程系

出　　处：《北京邮电大学学报》1996年第1期20-23,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家杰出青年基金;国家教委跨世纪优秀人才专项基金

摘　　要：引入二叉树表示布尔函数基本乘积项的思想，借助于布尔函数变换。The concept of binary-tree-representation of fundamental Boolean conjuntions is presented at first.Then,it is found that the known consensus operation for some fundamental Boolean conjuntions can be intutively realized on the binary tree,after some special transformations are made.

关 键 词：布尔函数 二叉树 基本乘积项 

分 类 号：O153.2[理学—数学]