In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-peb...
In this paper we present a new approach for measuring the relatedness between text segments, based on implicit semantic links between their words, as offered by a word thesaurus, n...
George Tsatsaronis, Iraklis Varlamis, Michalis Vaz...
One of the challenges a decision maker faces is choosing a suitable rough set model to use for data analysis. The traditional algebraic rough set model classifies objects into th...
— Previously we have shown that chaos can arise in networks of physically realistic neurons [1], [2]. Those networks contain a moderate to large number of units connected in a sp...
In this paper we consider a quantized discrete-time linear quadratic regulator (DLQR) problem, namely a DLQR problem where the input u may only take values in a given finite set ...