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

DOI10.1109/T-C.1970.222888zbMath0186.01403OpenAlexW2045575572MaRDI QIDQ5579501

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

Related Items (2)

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

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