A generalization of Nelson's algorithm for obtaining prime implicants

DOI10.2307/2270576zbMath0163.25704OpenAlexW2024227038MaRDI QIDQ5547601

R. W. House

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

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

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