并举例说明，对于不一致决策表，其属性约简的代数表示不能用条件信息量来等价表示。
Through examples, it shows that attribute reduction of an inconsistent decision table cannot entirely be represented by conditional information quantity.
最后证明了属性约简在布尔矩阵和代数两种不同表示下是等价的。
Finally, the equivalence properties between Boolean matrix representation and algebra representation of attribute reduction are proved.
由此，以多项式符号代数为理论基础，提出了一个高层次数据通路的等价验证算法。
So in this paper, a new algorithm for the equivalence verification of high-level data paths based on polynomial symbolic algebra is proposed.
应用推荐