MINIMISATION OF MULTIOPERATIONS IN A CLASS KEY STANDERD FORMS

Addresses the problem of minimizing multi-operations in a class of key standard forms. The work is based on the developed algorithm for minimizing multi-operations for n = 2 and n = 3 in the class of key standard forms. This algorithm is based on the analysis of multi-operations and the subsequent best replacements of all zero elements in order to obtain a minimal representation of multi-operations in the class of key standard forms. Using the developed algorithm, all minimal representations of multioperations for n = 2 and n = 3 in the class of key standard forms, the average complexity of the minimal representation of multioperations in the class of key standard forms and the quantitative distribution of multioperations by the complexity of the obtained minimal representations are obtained. The obtained results of minimizing multi-operations in the class of key standard forms are compared with the minimization of multi-operations in the class of standard forms. When comparing the results, it is concluded that the minimal representation of multi-operations in the class of standard forms is better than in the class of key standard forms.

Authors: S. I. Todikov

Direction: Informatics, Computer Technologies And Control

Keywords: Multiprocess, superclones, key standard form, algorithm, minimization

---

View full article