Programming, Binary Decision Diagrams, Computer Science, Boolean.
can refer to these nodes as being isomorphic subgraphs. We can also merge the 0 and 1 terminals into one because it makes it easier to draw. Performing these reduction rules can dramatically reduce the size of the BDD. When a BDD is ordered and reduced, it is known as a Reduced Order BDD (ROBDD).