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

1.1k questions

1.2k answers

1.6k comments

532 users

0 votes

I understood the procedure for converting ZDD to ROBDD:

  1. compute the set representations all nodes of the ZDD
  2. read the full DNF from the set representations
  3. convert the obtained DNF to Shannon normal form to get the BDD
Similarly, are there any rules for converting FDD to ROBDD? Could you please help me to solve this issue? [I have seen the FDD2BDD algorithm, are there any certain rules like the above mentioned?]
in # Study-Organisation (Master) by (2.7k points)

1 Answer

+1 vote
 
Best answer

Sure, you can proceed completely analogously:

  1. compute the set representations of all nodes of the FDD
  2. convert the set representations to the Reed Muller Normal Form (RMNF)
  3. convert the obtained RMNF to Shannon normal form to get the BDD
by (166k points)
selected by
Thank you, Professor

Related questions

0 votes
1 answer
0 votes
1 answer
asked Jul 22, 2022 in * TF "Emb. Sys. and Rob." by CS_E (2.9k points)
0 votes
1 answer
asked Jan 14 in * TF "Emb. Sys. and Rob." by Faris (180 points)
Imprint | Privacy Policy
...