Minimization of Boolean functions in the class of orthogonal disjunctive normal forms
The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be orthogonal, i. e. the conjunction of them would be equa...
Saved in:
| Main Author: | Yu. V. Pottosin |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2021-07-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/1131 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Experimental comparison of the effectiveness of programs for minimizing systems of Boolean functions in the class of disjunctive normal forms
by: P. N. Bibilo, et al.
Published: (2022-06-01) -
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-06-01) -
Algorithms for extracting subsystems from a multilevel representation of a system of Boolean functions for joint minimization
by: P. N. Bibilo, et al.
Published: (2024-12-01) -
Application of Election Functions to Estimate the Number of Monotone Self-Dual Boolean functions
by: Leonid Y. Bystrov, et al.
Published: (2022-06-01) -
The search for subsystems of related functions from multilevel representation of systems of Boolean functions1
by: P. N. Bibilo, et al.
Published: (2020-03-01)