System of transformations of certain representations of Boolean functions
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 7650336
- scientific article; zbMATH DE number 3930906
- Representations of Boolean functions
- Boolean function analogs of covering systems
- scientific article; zbMATH DE number 468778
- On systems of Boolean equations
- scientific article; zbMATH DE number 910728
- Representation of Boolean functions by polynomial forms
- scientific article; zbMATH DE number 1504655
- Boolean polynomials and linear transformations
Cited in
(17)- Multiple logic computations
- Transformations of discrete functions calculation algorithms to Boolean equations
- Boolean transformations with unique fixed points
- Binary predicates as representations of Boolean logic objects.
- scientific article; zbMATH DE number 3930906 (Why is no real title available?)
- scientific article; zbMATH DE number 4096781 (Why is no real title available?)
- scientific article; zbMATH DE number 1533821 (Why is no real title available?)
- The iota-delta function as an alternative to Boolean formalism
- Representations of Boolean functions
- scientific article; zbMATH DE number 1848368 (Why is no real title available?)
- scientific article; zbMATH DE number 2114566 (Why is no real title available?)
- ``Boolean functions is a system for the work with Boolean functions
- scientific article; zbMATH DE number 3204596 (Why is no real title available?)
- Transformations of expressions associated with systems of recursion relations
- scientific article; zbMATH DE number 7650336 (Why is no real title available?)
- Representations of normalized formulas
- On the orthogonalization of arbitrary Boolean formulae
This page was built for publication: System of transformations of certain representations of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084377)