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

543 users

0 votes
in * TF "Emb. Sys. and Rob." by (380 points)

1 Answer

0 votes

For leaf nodes L and any BDDs φ and e (where e is a conjunction of variables), the following holds:

  •     Forall(L,φ) = φ
  •     Forall(e,L) = L
  •     Forall(e,φ) = (xφ ? Forall(e,φ1) : Forall(e,φ0) )  : if D(xφ)>D(xe)
  •     Forall(e,φ) = Apply(&,Forall(e1,φ1) : Forall(e1,φ0) ) : if D(xφ)=D(xe)
  •     Forall(e,φ) = Forall(e1,φ)  : if D(xφ)=D(xe)

where in the last three cases, we have φ = (xφ ? φ1 : φ0) and e = (xe ? e1 : e0).

by (166k points)
Imprint | Privacy Policy
...