Functional completeness, also known as expressive adequacy, is the ability for a set of logical operators to produce all possible truth tables if appropriately connected. In the context of digital electronics, it can be seen as the minimum number of sets of logic gates needed to achieve all possible binary signals.
Attributes | Values |
---|---|
rdfs:label |
|
rdfs:comment |
|
dcterms:subject | |
abstract |
|