What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question by presenting a very general framework that allows to remove delay: finite-state strategies exist for all winning conditions where the resulting delay-free game admits a finite-state strategy. The framework is applicable to games whose winning condition is recognized by an automaton with an acceptance condition that satisfies a certain aggregation property.

Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. In particular, we cover all previous results of that kind as special cases of our uniform approach.

延迟博弈中的有限状态策略是什么？我们通过提出一个可以消除延迟的非常通用的框架来回答这个令人惊讶的非同寻常的问题：针对所有获胜条件存在有限状态策略，在这种情况下，最终的无延迟游戏就接受了有限状态策略。该框架适用于获胜条件被具有满足一定聚集性质的接受条件的自动机识别的游戏。

我们的框架还为确定此类延迟游戏的获胜者的复杂性提供了上限，并为赢得游戏提供了必要的前瞻性。尤其是，我们将以前的所有此类结果作为统一方法的特殊情况进行介绍。