Automata Theory

To the Problem of Realizability of Boolean Functions by Circuits in a Basis of Unreliable Functional Elements

V. V. Tarasov

Ryazan State Radiotechnical Academy

Abstract: Maximal extensions of Post classes containing 0, 1, and $x$ in the algebra of partially unreliable Boolean functions are described. Based on these extensions, criteria of expressibility of Boolean functions by circuits in a basis of partially unreliable elements are proved.

UDC: 621.391.1:519.713:681

Received: 26.04.2005
Revised: 14.02.2006

 English version: Problems of Information Transmission, 2006, 42:2, 152–157

Bibliographic databases:

• 
•