Ways of representation of the algorithm the controlling automaton follows, страница 5

3. if (a is equivalent to b),.


Figure 26.4 – An example of the GSA

            In the expressions (26.4), a,b,g are boolean functions of the variables x1, x2,…,xL.

            A set of formulas for all transitions is called the system of transition formulas.

            In the case of the algorithm depicted in the Fig. 26.4, the system of transition formulas is: