A miter's BDD is the terminal 0. Choose what follows.
A miter joins two designs that have the same inputs and outputs. It gives both designs the same inputs, takes the exclusive-or of each pair of corresponding outputs, and ORs those into one output. So the miter is 1 exactly on the inputs where some output of one design differs from the same output of the other.
Design A computes y = p & q, and design B computes y = p & q & r. They have one output each, so the miter is the exclusive-or of the two.
y = p & q
y = p & q & r
That exclusive-or is (p & q) ^ (p & q & r), which is p & q & ~r.
(p & q) ^ (p & q & r)
p & q & ~r
Its BDD is not the terminal 0: the path p = 1, q = 1, r = 0 reaches the terminal 1, and on that input A gives 1 and B gives 0.
p = 1, q = 1, r = 0
A miter that is not the constant 0 names an input on which the designs differ.
Under some variable order, the BDD of the miter of two designs is the terminal 0. What follows?
The two designs compute the same function on every input.
The two designs are equivalent under that variable order only.
Some input makes the two designs differ.
The two designs are built from the same gates.
Choose one of the four statements.
One statement.
Ask what the miter's value is on an input where the two designs differ, as the example shows.
Ask whether changing the variable order can change the function a BDD represents, or only the diagram that represents it.
Kata 6.3 of Binary Decision Diagrams with CUDD on formal.org. The site checks the answer when you press Check answer; sign in to keep your progress.