Decomposition of Boolean function and two-realizability

DOI10.1080/00207176808905692MaRDI QIDQ5565131zbMATH OpenOpenAlexFDO

Authors

Publication date 1968

Published in International Journal of Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207176808905692

zbMATH Keywords

languages, automata, networks

Cites work

• A Method for Testing and Realization of Threshold Functions
• A Method for Testing and Realization of Threshold Functions through Classification of Inequalities†
• An Approach to Single-Threshold-Element Synthesis
• Majority Gate Networks
• On a Method of Decomposition of Boolean Functions into Unate Functions for Synthesis with Threshold Logic Elements†
• Realization of Arbitrary Logical Functions Using Majority Elements
• Realization of Logical Functions by a Network of Threshold Components with Specified Sensitivity

This page was built for publication: Decomposition of Boolean function and two-realizability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565131)