On implementation of control algorithms in rearrangeable automata

Special-purpose LSIs used in logical design are modeled as rearrangeable automata, RA. General properties of the RA composition are studied; a general algorithm for composition design and ensuing particular algorithm for programmable logical matrices are proposed. The complexity of the resultant solutions is estimated.