Abstract: We prove that non-emptiness of timed register pushdown automata is decidable in doubly exponential time. This is a very expressive class of automata, whose transitions may involve state and ...
Abstract: In response to the demand for intelligent agents to perform complex tasks in dynamic and uncertain environments. Reinforcement learning algorithms unveil policies that aim to maximize ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results