Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Recursive temporal (RT) namespaces extend spatial namespaces such as IP with the notion of a nested time interval. RT namespace is an architectural approach to dealing with the un...
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...