ALGORITHM FOR THE FORMAL CALCULUS OF BOOLEAN EXPRESSIONS.

被引：0
|
作者：
Cavadia, I.C.
机构：
来源：
Revue Francaise d'Automatique Informatique Recherche Operationnelle | 1973年 / 7卷
关键词：
COMPUTER PROGRAMMING - Subroutines;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In the first part of this paper, an algorithm for the formal calculus of Boolean expressions was given. The disjunctive form (sum of products) thus obtained can be applied to the automatic prime implicates and prime implicants generation. The method is based on the Boolean variables representation previously presented.
引用
收藏
页码：63 / 84
相关论文
共 50 条
12345