Minimization of Boolean functions in the basis OR-NOT (AND-NOT)
The paper presents an algorithm that transforms an arbitrary formula on the basis of AND-OR-NOT to one of the basis of OR-NOT, while preserving the optimality of the formulas. In other words, the algorithm permits the transformation from a minimal (irredundant) formula on the basis of AND-OR-NOT to a minimal (irredundant) one, within a constant, on the basis of OR-NOT. It also establishes a correspondence between the minimal realization of a tree-type circuit of the elements AND, OR, NOT and one of the elements OR and NOT with any number of inputs and for a given Boolean function.
- Boolean minors
- scientific article; zbMATH DE number 4096781 (Why is no real title available?)
- scientific article; zbMATH DE number 1533821 (Why is no real title available?)
- OBDD minimization based on two-level representation of Boolean functions
- scientific article; zbMATH DE number 1822244 (Why is no real title available?)
- MINIMIZATION OF REPRESENTATIONS OF THE LOGICAL FUNCTION IN SCHAEFFER AND PIERCE BASES
- scientific article; zbMATH DE number 2210682 (Why is no real title available?)
- On the orthogonalization of arbitrary Boolean formulae
This page was built for publication: Minimization of Boolean functions in the basis OR-NOT (AND-NOT)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556312)
