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...
Main Author: | Yu. V. Pottosin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2021-07-01
|
Series: | Informatika |
Subjects: | |
Online Access: | https://inf.grid.by/jour/article/view/1131 |
Similar Items
-
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-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) -
Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors
by: P. N. Bibilo, et al.
Published: (2021-07-01) -
Domination, Eternal Domination, and Clique Covering
by: Klostermeyer William F., et al.
Published: (2015-05-01) -
Independent set dominating sets in bipartite graphs
by: Bohdan Zelinka
Published: (2005-01-01)