Loading [a11y]/accessibility-menu.js
Comments on "Computing Irredundant Normal Forms from Abbreviated Presence Functions" | IEEE Journals & Magazine | IEEE Xplore

Comments on "Computing Irredundant Normal Forms from Abbreviated Presence Functions"


Abstract:

A theorem about conditionally eliminable prime implicants presented by Chang and Mott1is shown to be incorrect by counterexample.

Abstract:

A theorem about conditionally eliminable prime implicants presented by Chang and Mott1is shown to be incorrect by counterexample.
Published in: IEEE Transactions on Computers ( Volume: C-28, Issue: 11, November 1979)
Page(s): 874 - 875
Date of Publication: 30 November 1979

ISSN Information:


References

References is not available for this document.