Finite isomorphically complete systems

AbstractIn the theory of finite automata it is an important problem to characterize such systems of automata from which any automaton can be built under a given composition and representation. Such systems are called complete with respect to the fixed composition and representation. From practical point of view, it is useful to determine those compositions and representations for which there are finite complete systems. In this paper we show that the existence of finite complete systems implies the unboundedness of the feedback dependency of the composition