| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Schreiber, Michael | |
| dc.date | 2016-10-26T18:04:20Z | |
| dc.date | 2016-10-26T18:04:20Z | |
| dc.date.accessioned | 2017-04-06T12:46:52Z | |
| dc.date.available | 2017-04-06T12:46:52Z | |
| dc.identifier | http://acervodigital.unesp.br/handle/unesp/368794 | |
| dc.identifier | http://objetoseducacionais2.mec.gov.br/handle/mec/24092 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/965076 | |
| dc.description | The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all rows that return True. The prime implicants for these cases consolidate rules by introducing so-called "don't care" inputs that specify cases that do not depend on the value of a particular input. The minimal disjunctive form of a Boolean function is found by taking the smallest number of prime implicants.
The left plot presents a randomly generated truth table. The red vertical line separates the input bits on the left from the output on the right. The second plot tabulates the disjunctive normal form that includes only those cases which return True. The third plot shows all prime implicants and marks "don't care" inputs by cyan-colored squares. The right plot shows the minimal disjunctive normal form. | |
| dc.description | Educação Superior::Ciências Exatas e da Terra::Matemática | |
| dc.publisher | Wolfram demonstrations project | |
| dc.relation | MinimalDisjunctiveNormalForm.nbp | |
| dc.rights | Demonstrations freewre using MathematicaPlayer | |
| dc.subject | Demonstrações de teoremas | |
| dc.subject | Educação Superior::Ciências Exatas e da Terra::Matemática::Lógica Matemática | |
| dc.title | Minimal disjunctive normal form | |
| dc.type | Otro | |
