|
This article is cited in 7 scientific papers (total in 7 papers)
Theoretical Foundations of Computer Science
On algorithmic properties of finite subset algebra for some unoids
S. M. Dudakov Tver State University, Tver
Abstract:
We consider unoids consisting of identical non-branching trees which are connected into an infinite line. We establish that the finite subset algebra admits effective quantifier elimination and it does not depend on the original algebra. So, we have an instance where the finite subset algebra theory is algorithmically simpler than the theory of the original one. Also it demonstrates that the union operation for finite subset algebras does matter for algorithmical properties.
Keywords:
unoid, non-branching tree, subset algebra, quantifier elimination.
Received: 03.12.2019 Revised: 20.12.2019
Citation:
S. M. Dudakov, “On algorithmic properties of finite subset algebra for some unoids”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2019, no. 4, 108–116
Linking options:
https://www.mathnet.ru/eng/vtpmk550 https://www.mathnet.ru/eng/vtpmk/y2019/i4/p108
|
Statistics & downloads: |
Abstract page: | 284 | Full-text PDF : | 150 | References: | 52 |
|