The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits (Q1848652)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits |
scientific article; zbMATH DE number 1827457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits |
scientific article; zbMATH DE number 1827457 |
Statements
The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits (English)
0 references
13 November 2002
0 references
The article considers iterative control systems with memory. The notion of conveyor Boolean circuit is introduced. A variety of subclasses of the conveyor circuits class is considered, and in some of the subclasses the minimal memory volume for the realization of an arbitrary Boolean function is obtained.
0 references
Boolean function
0 references
Boolean conveyor schemes
0 references
0.9405007362365724
0 references
0.7417795658111572
0 references
0.7348456978797913
0 references
0.7270538806915283
0 references
