You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

33 lines
1.3 KiB

9 months ago
  1. \item \lect Given the \textit{Binary Decision Diagram (BDD)} below,
  2. find a satisfying and a falsifying model of $f$.
  3. \begin{center}
  4. \begin{forest}
  5. for tree={circle, draw, no edge,
  6. minimum size=2em,
  7. inner sep=0pt,
  8. s sep=2mm,
  9. l sep=4mm}
  10. [$f$, rectangle, draw, tikz={\draw [line] () to (a.north);}
  11. [$a$, name=a, tikz={\draw [line] () to (b.north east); \draw [dot=.5] () to (c2.north west);}
  12. [$b$, name=b, tikz={\draw [dot=.5, bend left] () to (c1.north east); \draw [line, bend right] () to (c1.north west);}
  13. [$c$, name=c1, s sep=20mm, tikz={\draw [line] () to (one.north); \draw [dot=.5] () to (e.north west);}
  14. [,phantom]
  15. [$e$, name=e, s sep=10mm, tikz={\draw [line, bend left] () to (one.north east); \draw [dot=.5, bend left] () to (one.east);}
  16. [$1$, rectangle, draw, name=one]
  17. [$0$, rectangle, draw, name=zero]
  18. ]
  19. ]
  20. ]
  21. [$c$, name=c2, tikz={\draw [line, bend right] () to (e.north); \draw [dot=.5, bend left] () to (d.north);}
  22. [,phantom]
  23. [$d$, name=d, tikz={\draw [line] () to (e.north east); \draw[dot=.5] () to (zero.north);
  24. }
  25. [,phantom]
  26. [,phantom]
  27. ]
  28. ]
  29. ]
  30. ]
  31. \end{forest}
  32. \end{center}