A Method for the Fast Approximate Solution of Large Prime Implicant Charts

DOI10.1109/T-C.1970.222888MaRDI QIDQ5579501zbMATH OpenOpenAlexFDO

Authors R. M. Bowman, Eugene S. McVey

Publication date 1970

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/t-c.1970.222888

zbMATH Keywords

languages, automata, networks

Cited in

(2)

• Boolean function minimization in the class of disjunctive normal forms
• Minimal covering problem and PLA minimization

This page was built for publication: A Method for the Fast Approximate Solution of Large Prime Implicant Charts

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