|
This article is cited in 3 scientific papers (total in 3 papers)
Algebraic and logical methods in computer science and artificial intelligence
Classification of multioperations of rank $2$ by $E$-precomplete sets
V. I. Panteleev, L. V. Riabets Irkutsk State University, Irkutsk, Russian Federation
Abstract:
In this paper multioperations defined on a two-element set and their closure operator based on composition operator and the equality predicate branching operator is considered. The composition operator is based on union of sets. The classification of multioperations based on their membership in precomplete sets has been obtained. It is shown that the number of equivalence classes is $129$. All types of bases are described and it is proved that the maximum cardinality of a basis is $4$.
Keywords:
closure, equality predicate, multioperation, closed set, composition, precomlete set.
Received: 24.10.2020
Citation:
V. I. Panteleev, L. V. Riabets, “Classification of multioperations of rank $2$ by $E$-precomplete sets”, Bulletin of Irkutsk State University. Series Mathematics, 34 (2020), 93–108
Linking options:
https://www.mathnet.ru/eng/iigum437 https://www.mathnet.ru/eng/iigum/v34/p93
|
Statistics & downloads: |
Abstract page: | 101 | Full-text PDF : | 77 | References: | 18 |
|