Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

868 questions

986 answers

1.4k comments

438 users

0 votes
I have 2 questions

1) Suppose we are asked to convert an ZDD to FDD where originally a FDD diagram is given, should we apply Elimination rule before performing set representation(If any high(v)=0)

2) Suppose in the final ZDD that we get after doing positive Davio decomposition, if we have any node that has high(v)=0,  should we apply Elimination rule?
in * TF "Emb. Sys. and Rob." by (1k points)
edited by

1 Answer

0 votes
I do not really understand the question (and maybe should not answer because of this), but I think that you would have to first derive the set representation (where you do not need the elimination rule). From the set representation you directly get the RMNF, and therefore the Boolean function. From here, you compute the ZDD of a given Boolean function by repeatedly performing Shannon decompositions (and here you have to apply the elimination rule of the ZDDs).
by (139k points)
Thank you professor

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...