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

870 questions

988 answers

1.4k comments

439 users

0 votes

The 2nd part of the question is to find the set representation for ZDD from FDD. I have done the first part and that is correct. But for the second part tool is giving "{{a,b,c};{a,c};{a};{}}" this answer, but when i tried, i got this answer "{{a,b,c};{a,c};{}}". I have added the steps that I have done. Could you please help me to solve this issue?

in * TF "Emb. Sys. and Rob." by (1.1k points)

1 Answer

+1 vote
 
Best answer

After you found the formula in RMNF (c&b) xor (a&c) xor (c) xor (b) xor true that is represented by the FDD, you want to construct the ZDD. To this end, you perform repeated Shannon decompositions as far as I can see. Shannon decomposition on c yields the following two 

  • (false&b) xor (a& false) xor (false) xor (b) xor true which is b xor true
  • (true&b) xor (a& true) xor (true) xor (b) xor true  = b xor a xor true xor b xor true = a
The ZDD for not b is however the one that you can see as the low ZDD of the following correct solution (it shows the desired ZDD), i.e., it is supressing the negation of b (which ZDDs do) but has to make a redundant case distinction on the other variable a.
by (139k points)
selected by
I understood . Thank you professor.

Related questions

+1 vote
1 answer
+1 vote
1 answer
Imprint | Privacy Policy
...