I think the answer is (2^m)^(2^n) (or 2^(m*2^n))
For m=1, the answer is 2^2^n.
We can express the function using a truth table with 2^n entries, one
entry for each possible input set.
And each entry has (n+m) fields, represent the n inputs and m outputs.
The m*2^n output fields can be filled freely.
So there are 2^(m*2^n) different truth tables.
On 2010-12-10 18:59, ankit sablok wrote:
Q) an n-input m-output boolean function is defined as follows
(F:{True,False}^n->{True,False}
^m)
find the number of n X 1 functions meaning n inputs and 1 output
and n X m funcrtions meaning n inputs and m outputs
my answer
at any time we can reduce the problems as follows
in the domain we will always be havibg n input variables and the co-
domain can be thought of as having 2 values {True and False}
condisering this i get the number of n X 1 functions as
2^n. Please do suggest me the alternative if i am wrong. thanx in
advance
and the nswer reamins the sam for me in case of finding the number of
n X m functions.
Please help me out if i m wrong in solving this thanx in advance
--
You received this message because you are subscribed to the Google Groups "Algorithm
Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
