Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/to-the-problem-of-realizability-of-boolean-functions-by-circuits-in-a-Pl9iZx0Lz4
References (6)
-
V.V. Tarasov (1976)
On the Synthesis of Reliable Circuits from Unreliable ElementsMat. Zametki, 20
-
V.V. Tarasov (1975)
A Test for the Completeness of Not Everywhere Defined Functions of the Algebra of LogicProbl. Kibern., 30
-
S.A. Lozhkin (2004)
Proc. 6th Int. Conf. on Discrete Models in the Theory of Control Systems, Moscow, 2004 -
R.V. Freivald (1966)
Diskretnyi analiz -
S.V. Yablonskii, G.P. Gavrilov, V.B. Kudryavtsev (1966)
Funktsii algebry logiki i klassy Posta -
V. Tarasov (1976)
The synthesis of reliable circuits from unreliable elementsMathematical notes of the Academy of Sciences of the USSR, 20
- Publisher
- Springer Journals
- Copyright
- Copyright © 2006 by Pleiades Publishing, Inc.
- Subject
- Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
- ISSN
- 0032-9460
- eISSN
- 1608-3253
- DOI
- 10.1134/S0032946006020086
- Publisher site
- See Article on Publisher Site
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.
Journal
Problems of Information Transmission – Springer Journals
Published: Jul 7, 2006