布尔表达式和正则表达式_布尔表达式约简的对偶原理和规则

布尔表达式和正则表达式

对偶原理 (Duality Principle)

According to this principle, if we have postulates or theorems of Boolean Algebra for one type of operation then that operation can be converted into another type of operation (i.e., AND can be converted to OR and vice-versa) just by interchanging '0 with 1', '1 with 0', '(+) sign with (.) sign' and '(.) sign with (+) sign'. This principle ensures if a theorem is proved using postulates of Boolean algebra, then the dual of this theorem automatically holds and we need not prove it again separately.

根据此原理，如果我们为一种类型的运算提供了布尔代数的假设或定理，则只需将“ 0”与“-”互换即可将其转换为另一种类型的运算(即， AND可以转换为OR，反之亦然 ) 。 1' ， '1与0' ， '(+)与(。)符号'和'(。)与(+)符号' 。 这个原理确保了，如果使用布尔代数的假设来证明一个定理，那么该定理的对偶就会自动成立，我们不需要再次证明它。

Some Boolean expressions and their corresponding duals are given below,

下面给出了一些布尔表达式及其对应的对偶，