Tree Games With Regular Objectives
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE(2014)
摘要
We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic m - calculus. With expressive power comes complexity. Mio showed that tree games are able to encode Blackwell games and, consequently, are not determined under deterministic strategies.We show that non-stochastic tree games with objectives recognisable by so-called game automata are determined under deterministic, finite memory strategies. Moreover, we give an elementary algorithmic procedure which, for an arbitrary regular language L and a finite non-stochastic tree game with a winning objective L decides if the game is determined under deterministic strategies.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要