Question: An n-input, m-output boolean function is a function from {TRUE, FALSE} n to {TRUE, FALSE} m . How many n-input, 1-output boolean functions are there?
An n-input, m-output boolean function is a function from {TRUE, FALSE}n to {TRUE, FALSE}m. How many n-input, 1-output boolean functions are there? How many n-input, m-output boolean functions are there?
Step by Step Solution
3.37 Rating (166 Votes )
There are 3 Steps involved in it
There are 2n2n possible inputs We can represent the possibl... View full answer
Get step-by-step solutions from verified subject matter experts
