Explain dual and self dual function in boolean algebra
Answers
Answered by
0
A boolean function is self-dual, if it is negated by negating all inputs.
When a logical expression is represented by AND, OR and NOT operations, the dual function is obtained by first appropriately appending parenthesis, and then by interchanging the AND with OR operations. This is clear by the De Morgan's theorem.
When a logical expression is represented by AND, OR and NOT operations, the dual function is obtained by first appropriately appending parenthesis, and then by interchanging the AND with OR operations. This is clear by the De Morgan's theorem.
Neero:
no no i answered a computer science question
i think you are asking different
Similar questions