On Modular Networks Satisfying the Shift-Register Rule

This paper considers the synthesis of the network N which realizes the original program (problem oriented network) N is assembled from n unit modules partitioned into r categories (r ≥ 1) each of which is formed from identical modules.