Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...