KIAM Main page Web Library  •  Publication Searh  Русский 

Article collection "Mathematical Problems of Cybernetics" №5, Moscow, 1994
Authors: Turdaliev N.I.
On self-correction of logic networks for some Boolean functions
We propose a method of synthesis of nontrivial self-correcting logic networks regarding a faults in an arbitrary finite complete basis for Boolean operators (including Boolean functions), which can be implemented by networks having a block structure in the same basis. We obtain the upper bound of the complexity of implementation of such operators in this class of self-correcting networks. In particular, we find a nontrivial upper bound on the complexity of implementation of the comparison function of two binary n-tuples in the class of 1-self-correcting networks in the standard basis {&,V,¬}.
self-correcting logic network, Boolean function, Boolean operator, network complexity
Publication language: russian,  pages: 15 (p. 280-294)
Research direction:
Mathematical problems and theory of numerical methods
Russian source text:
Export link to publication in format:   RIS    BibTeX
About authors:
  • Turdaliev Nurlan Iliasovich