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

1.1k questions

1.3k answers

1.7k comments

557 users

0 votes
I am comfused in constructing ROBDD and ZDD for given any propostional equation?

for both we need to convert equation to snf and draw diagram

then what is difference between ROBDD and ZDD for given any propostional equation?
in * TF "Emb. Sys. and Rob." by (550 points)

1 Answer

0 votes
ZDD and BDDs use both the Shannon expansion as you say. However, they use different elimination rules. While BDDs eliminate nodes like (a=>b|b), ZDDs eliminate nodes (a=>0|b) which is also the same elimination rule as used by FDDs. See slide 138 of the related chapter.
by (170k points)
ZDD and BDDs

Related questions

0 votes
1 answer
asked Aug 14, 2020 in * TF "Emb. Sys. and Rob." by narayan (200 points)
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 Aug 5, 2020 in * TF "Emb. Sys. and Rob." by ssripa (550 points)
Imprint | Privacy Policy
...