System of transformations of certain representations of Boolean functions (Q1084377)
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: System of transformations of certain representations of Boolean functions |
scientific article; zbMATH DE number 3978983
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | System of transformations of certain representations of Boolean functions |
scientific article; zbMATH DE number 3978983 |
Statements
System of transformations of certain representations of Boolean functions (English)
0 references
1985
0 references
Three forms of representation of Boolean functions are considered: the nonrepetitive Boolean formula, the linear binary graph, and the orthogonal disjunctive normal form. A one-to-one correspondence among them is exhibited, and a complete system of equivalent transformations is studied. The role of these transformations in computer-aided programming of logical devices is noted.
0 references
representation of Boolean functions
0 references
nonrepetitive Boolean formula
0 references
linear binary graph
0 references
orthogonal disjunctive normal form
0 references
computer-aided programming of logical devices
0 references
0 references
0.87372386
0 references
0 references
0.8665324
0 references
0.8642215
0 references
