Module 1 — Expand a Boolean function on its variables · Binary Decision Diagrams with CUDD

formal.org
Binary Decision Diagrams with CUDD

Module 1 — Expand a Boolean function on its variablesBoolean functions and truth tables, cofactors, Shannon expansion, decision trees, and why canonical forms matter.Katas in this module (4)

Kata 1.1 — Compute two cofactors by hand

Kata 1.2 — Rebuild a function from its cofactors

Kata 1.3 — Write a function to a specification

Kata 1.4 — Choose the valid expansion

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