On the synthesis of networks of functional elements (Q1380258)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1122756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the synthesis of networks of functional elements |
scientific article; zbMATH DE number 1122756 |
Statements
On the synthesis of networks of functional elements (English)
0 references
23 May 1998
0 references
The author develops the concept of \(N\)-closure and \(N\)-completeness for systems of Boolean functions arising from networks of functional elements or logical nets [\textit{A. W. Burks} and \textit{J. B. Wright}, Proc. IRE 41, No. 10, 1357-1365 (1953; Zbl 0148.25305)]. It is shown that the family of the \(N\)-closed classes is represented by the 25 Post classes established in 1979 by A. V. Kuznetsov in connection with his study of parametric expressibility. Also an \(N\)-completeness criterion is formulated and an asymptotic estimate given for the realization complexity function. Proofs are not included.
0 references
complexity function
0 references
completeness
0 references
closed classes
0 references
systems of Boolean functions
0 references
networks of functional elements
0 references
logical nets
0 references
Post classes
0 references
0.8459245
0 references
0.8413775
0 references
0 references
0.8359715
0 references
0.83022225
0 references
0.8256227
0 references
0.82304597
0 references
