Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
In this paper, we present a generalization of the relational data model based on interval neutrosophic set [1]. Our data model is capable of manipulating incomplete as well as inc...
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...