Some criteria for bounds on homogeneous nets (Q2538852)

The paper under review is concerned with the realization of arbitrary automata in homogeneous logical nets; i.e. networks of identical and identically interconnected functional elements, each able to realize any function in a given set of functions. In particular, it is concerned with determining the redundancy required (in terms of the number of functional units) for the realization of an automaton with a loop-free structural graph of order \(n\) (combination automaton) or with a complete symmetric structural graph (sequential automaton) in a particular homogeneous logical net. Under mild assumptions, numerical values for the upper bounds for the redundancy (or, alternately, the efficiency) of the realization of sequential or combinatorial automata in logical nets are obtained.