Question: Prove that any n - input logic function f ( x 1 , . . . , xn ) that can be written in the
Prove that any ninput logic function fxxn that can be written in
the form f xiGxxixixnxiGDxxixixn is selfdual
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
