ABSTRACT
From these basic rules are derived the four elementary equivalences shown in Figure 3, which guide one in the manipulation of signal-flow graphs. These equivalences are sufficient for the complete reduction of a graph containing no feedback loops. To handle graphs that incorporate feedback loops, there are two additional equivalence relations. Consider a self-loop in which a node signal is fed back to itself as illustrated on the left-hand side of Figure 3.
