Decomposition of Boolean function and two-realizability

DOI10.1080/00207176808905692zbMath0175.28101OpenAlexW2128119935MaRDI QIDQ5565131

No author found.

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

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

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