摘要
本文运用模代数矩阵分析法,导出了简单RM展开式和复杂RM展开式的b_j矩阵判别法则,并给出了将n变量RM展开式化为具有最少和项的单变量函数积之和的规范算法,该算法可以在计算机上实现,从而为多值逻辑函数的综合提供了一种新的手段.
By means of the modulo-algebra matrix analysis, this paper introduces thejudging principles of the bj matrix for both simple RM expansion and complex RM expansion. The standard algorithm which can transform the RM expansion with arbitrary n variables into the Sop of the single-variable functions with least sums is derived. The algorithm can be realized by computers.
出处
《计算机学报》
EI
CSCD
北大核心
1992年第6期426-434,共9页
Chinese Journal of Computers
基金
折江省自然科学基金
关键词
模代数
矩阵分析
展开式
Modulo-algebra matrix analysis, RM expansion, bj matrix.
