Renyi-Ulam对策与禁止子串
Renyi-Ulam Games and Forbidden Substrings
摘要：
Renyi-Ulam游戏是在两名玩家之间进行的，Seeker和Obscurer。模糊器会想到一个介于1和$n$之间的数字。搜索者希望识别该号码。在每一轮，搜索者询问模糊者她的号码是否属于从1到$n$的特定子集。模糊者回答是或否，她的回答是真或假。模糊者给出的一系列真相和谎言必须符合玩家事先同意的一个限制$R$。我们给出了允许搜索者获胜的限制$R$的标准。然后，我们将我们的结果的研究特征的限制禁止子串。特别是，我们给出了一个完整的分类，所有这些限制的特征在于两个禁止子串，详细说明Czyzowicz，Lakshmanan和Pelc的分类，所有这些限制的特征在于一个禁止子串。
英文摘要：
The Renyi-Ulam game is played between two players, the Seeker and the Obscurer. The Obscurer thinks of a number between 1 and $n$. The Seeker wishes to identify that number. On each turn, the Seeker asks the Obscurer whether her number belongs to a specific subset of the numbers from 1 to $n$. The Obscurer answers either yes or no, and her answer is either true or false. The series of truths and lies given by the Obscurer must conform to a restriction $R$ that the players have agreed on in advance. We give criteria on the restrictions $R$ that allow the Seeker to win. Then we apply our results to the study of restrictions characterized by forbidden substrings. In particular, we give a complete classification of all such restrictions characterized by two forbidden substrings, elaborating on Czyzowicz, Lakshmanan and Pelc's classification of all such restrictions characterized by one forbidden substring.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
