Titlebook: STACS 2007; 24th Annual Symposiu Wolfgang Thomas,Pascal Weil Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Automat.alg

MURKY

充足

Pure Stationary Optimal Strategies in Markov Decision Processesyoff functions, and we prove that any MDP equipped with such a payoff function admits pure stationary optimal strategies..This result unifies and simplifies several existing proofs. Moreover, it is a key tool for generating new examples of MDPs with pure stationary optimal strategies.

先行

大雨

弄脏

Speed-Up Techniques for Shortest-Path Computationse for typical instances. They are usually based on a preprocessing that annotates the graph with additional information which can be used to prune or guide the search. Timetable information in public transport is a traditional application domain for such techniques. In this paper, we provide a conde

Expostulate

显而易见

睨视

Bernstein-test

propose

On the Size of the Universal Automaton of a Regular Languageired by the factor matrix defined by Conway thirty years ago. We prove in this paper that a tight bound on its size with respect to the size of the smallest equivalent NFA is given by Dedekind’s numbers. At the end of the paper, we deal with the unary case. Chrobak has proved that the size of the mi