Доступ предоставлен для: Guest
Journal of Automation and Information Sciences

Выходит 12 номеров в год

ISSN Печать: 1064-2315

ISSN Онлайн: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

The Minimization Technique for Boolean Functions

Том 32, Выпуск 1, 2000, pp. 76-86
DOI: 10.1615/JAutomatInfScien.v32.i1.110
Get accessGet access

Краткое описание

We consider the new minimization technique for Boolean functions of many variables in so called conjuncterm field which is formed by a set of the in advance specified values of conjunctive terms of all ranks. The technique is based on the following: it compares the numerical values of the given function with the numbers of this field. The algorithm demands the less number of operations comparatively with the traditional one. There are two versions of its application: the manual one which uses (the pattern of) the function and the computer one which uses matrices of the conjuncterm of a function of n variables. One can apply the proposed rule also for minimizing of a system of Boolean functions.

Портал Begell Электронная Бибилиотека e-Книги Журналы Справочники и Сборники статей Коллекции Цены и условия подписки Begell House Контакты Language English 中文 Русский Português German French Spain