National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Minimisation of Logical Functions
Horký, Miroslav ; Davidová, Olga (referee) ; Šeda, Miloš (advisor)
For minimisation of logical functions, laws of the Boolean algebra and the Karnaugh maps are mostly used. However, use of Karnaugh's maps is based on visual recognition of adjacent cells for functions with no more than 6 variables and, therefore, the method is not suitable for automated processing on computers. A direct application of the Boolean algebra laws is not restricted in this way, but there is no general algorithm defining the sequence of their application and thus this approach is not suitable for computer implementation either. The well-known method usable on computers is the algorithm proposed by E. J. McCluskey and W. Orman Quine.
Minimisation of Logical Functions
Horký, Miroslav ; Davidová, Olga (referee) ; Šeda, Miloš (advisor)
For minimisation of logical functions, laws of the Boolean algebra and the Karnaugh maps are mostly used. However, use of Karnaugh's maps is based on visual recognition of adjacent cells for functions with no more than 6 variables and, therefore, the method is not suitable for automated processing on computers. A direct application of the Boolean algebra laws is not restricted in this way, but there is no general algorithm defining the sequence of their application and thus this approach is not suitable for computer implementation either. The well-known method usable on computers is the algorithm proposed by E. J. McCluskey and W. Orman Quine.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.