On the Minimal Complexity of Component-Machines for Self-Correcting Networks

Publisher Website
Google Scholar
Abstract
A concept of nets of finite automata was introduced in [3] and self-correcting nets were investigated. These results will be improved in that we will restrict ourselves to nets over component-machines of a lower complexity and—in addition—do allow more faults. Several constructions are shown in detail that prove the self-correcting universality of nets compounded with simple component-machines. An impossibility-theorem will be stated and, thus, a precise boundary of complexity for the component-machines necessary and sufficient for self-correcting nets will be obtained.

This publication has 0 references indexed in Scilit: