|
Problemy Peredachi Informatsii, 2006, Volume 42, Issue 2, Pages 94–100
(Mi ppi46)
|
|
|
|
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.
Received: 26.04.2005 Revised: 14.02.2006
Citation:
V. V. Tarasov, “To the Problem of Realizability of Boolean Functions by Circuits in a Basis
of Unreliable Functional Elements”, Probl. Peredachi Inf., 42:2 (2006), 94–100; Problems Inform. Transmission, 42:2 (2006), 152–157
Linking options:
https://www.mathnet.ru/eng/ppi46 https://www.mathnet.ru/eng/ppi/v42/i2/p94
|
Statistics & downloads: |
Abstract page: | 260 | Full-text PDF : | 95 | References: | 29 |
|