Modified Method of McCluskey for Minimizing Incompletely Defined Logical Functions

No Thumbnail Available
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Samarkand branch of TUIT
Abstract
Description
This paper presents an improved method for applying the McCluskey Boolean function minimization algorithm to determine the minimum disjunctive normal form of an incompletely defined function. To continue the incompletely defined function, maximum intervals were created corresponding to the values 1 and 0 of the function, a table of differences was created for them, and unions were created using the max-min dead-end disjunctive normal form method. This paper describes the practical application of the method using an example. The results of your work can be used in the analysis and synthesis of incompletely defined logical structures.
Mazkur ishda mantiqiy funksiyani minimallashtirishning Mak-Klaski algoritmini to‘liq aniqlanmagan funksiyani minimal dizyunktiv normal shaklini aniqlashga tadbiq qilish uchun takomillashtirilgan usul berilgan. To‘liq aniqlanmagan funksiyani davom ettirish uchun, funksiya 1 qiymatlari va 0 qiymatlariga mos maksimal intervallar hosil qilingan va ular uchun farqlar jadvali tuzilib max-min usulida tupikli dizyunktiv normal shakl konyunksiyalari hosil qilingan. Mazkur ishda usulni amalda tadbiqi misol orqali bayon etilgan. Ishing natijalaridan to‘liq aniqlanmagan mantiqiy tuzilmalarni analizi va sintezi masalalarida qo‘llash mumkin.
Keywords
Incompletely defined function, disjunctive normal form, logical function, minimal disjunctive normal form of a function, elementary conjunctions, differentiation table, McCluskey algorithm, Qisman aniqlangan funksiya, dizyunktiv normal shakl, mantiqiy funksiya, funksiyaning minimal dizyunktiv normal shakli, elementar konyuksiyalar, farqlash jadvali, Mak-Klaski algoritmi
Citation