Bibliographic Details
| Title: |
An approach to the minimization problem of Boolean functions |
| Authors: |
Ušćumlić, M. P. |
| Publisher Information: |
Mathematical Society of Serbia (Društvo Matematičara Srbije), Belgrade |
| Subject Terms: |
algorithm, Switching theory, application of Boolean algebra, Boolean functions, logical tree |
| Description: |
In this article a new method of minimization of Boolean functions in the base (\(\vee,\wedge,-)\) is developed. In this method no form of representing Boolean functions by means of logical variables or well known logical operations is used. Only the assembly of indexes and their connection defined by the structure of the logical tree, that is to say by assembly of the definition of Boolean functions is used. The algorithm could be effectively applied for minimization of Boolean functions with up to five variables, and in certain cases with even more. Apart from that, the algorithm is suitable for programming on computers. |
| Document Type: |
Article |
| File Description: |
application/xml |
| Access URL: |
https://zbmath.org/3894979 |
| Accession Number: |
edsair.c2b0b933574d..f3f256b94aead158797a1f1d893fd8c6 |
| Database: |
OpenAIRE |