From WikiChip
Difference between revisions of "boolean algebra/incompletely specified function"
Line 3: | Line 3: | ||
==Overview== | ==Overview== | ||
− | In many situations when working with [[combinational circuit]]s, some combinations of inputs [[can't happen|should not occur]] under normal working conditions. For those combinations | + | In many situations when working with [[combinational circuit]]s, some combinations of inputs [[can't happen|should not occur]] under normal working conditions. For circuits with such combinations, those combinations can be treated as either 0 or 1 depending on whichever yields a more [[logic minimization|simplified]] Boolean expression. |
− | |||
{{stub}} | {{stub}} |
Revision as of 17:13, 15 December 2015
An Incompletely specified function is a Boolean function that only define output values for a subset of its inputs. Incompletely specified functions often make no guarantees as to the unspecified output whatsoever.
Overview
In many situations when working with combinational circuits, some combinations of inputs should not occur under normal working conditions. For circuits with such combinations, those combinations can be treated as either 0 or 1 depending on whichever yields a more simplified Boolean expression.
![]() |
This article is still a stub and needs your attention. You can help improve this article by editing this page and adding the missing information. |