Module 2 — Reduce a decision tree to an ROBDD · Binary Decision Diagrams with CUDD

formal.org
Binary Decision Diagrams with CUDD

Module 2 — Reduce a decision tree to an ROBDDThe three reduction rules, Bryant's bottom-up procedure, counting the nodes of an ROBDD, canonicity, and how CUDD stores the same diagram.Katas in this module (4)

Kata 2.1 — Name the rule that removes a node

Kata 2.2 — Build one node per level

Kata 2.3 — Write the same function with fewer operators

Kata 2.4 — Hit a size target

Part of Binary Decision Diagrams with CUDD on formal.org.