有规则目标的树博弈
Tree games with regular objectives
摘要：
我们研究树游戏最近开发的Matteo Mio作为游戏的概率$μ$ -演算的解释。表达能力带来了复杂性。米奥表明，树游戏能够编码布莱克威尔游戏，因此，在确定性策略下不确定。我们表明，非随机树游戏的目标可识别的所谓的游戏自动机确定下确定性，有限的内存策略。此外，我们给出了一个基本的算法程序，该程序对任意正则语言L和一个有限的非随机树博弈，获胜的目标L决定，如果游戏是确定性的战略。
英文摘要：
We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic $μ$-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分析而来，可能存在错误，请以论文正文为准。
