Implementation of the algorithm for constructing a corrector of multivalued logic functions
Аннотация
The article considers the implementation of the algorithm for constructing a corrector, where the features of the algorithm for constructing dead-end normal canonical forms of not everywhere defined functions of multivalued logic are studied. A criterion is proved for the representation of conjunctions of normal canonical forms of not everywhere defined functions by pairs of numbers in decimal calculus. The performance of gluing and absorption operations based on the representation of conjunctions by pairs of decimal numbers is given. A description is given of a program for constructing an optimal corrector for an arbitrary k not everywhere defined functions of many-valued logic. Descriptions of the program for implementing the invariant continuation algorithm and the program for constructing the shortest normal canonical forms of functions of k-valued logic are proposed.