Winning Strategies for Streaming Rewriting Games.
FCT(2019)
摘要
Context-free games on strings are two-player rewriting games based on a set of production rules and a regular target language. In each round, the first player selects a position of the current string; then the second player replaces the symbol at that position according to one of the production rules. The first player wins as soon as the current string belongs to the target language. In this paper the one-pass setting for context-free games is studied, where the knowledge of the first player is incomplete: She selects positions in a left-to-right fashion and only sees the current symbol and the symbols from previous rounds. The paper studies conditions under which dominant and undominated strategies exist for the first player, and when they can be chosen from restricted types of strategies that can be computed efficiently.
更多查看译文
关键词
Context-free games, Rewriting games, Streaming, Incomplete information, strategies
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络