A generalization of Nelson's algorithm for obtaining prime implicants

DOI10.2307/2270576MaRDI QIDQ5547601zbMATH OpenOpenAlexFDO

Authors R. W. House, Tibor Radó

Publication date 1965

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2270576

zbMATH Keywords

languages, automata, networks

Cites work

• On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems
• On Cores and Prime Implicants of Truth Functions
• Weak simplest normal truth functions

This page was built for publication: A generalization of Nelson's algorithm for obtaining prime implicants

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