使用Subshift
Playing with Subshifts
摘要：
我们研究了一类构词游戏，两个玩家从有限的字母表中挑选字母来构建一个有限或无限的单词。结果由所得到的单词是否位于规定的集合中（玩家$A$获胜）或不位于规定的集合中（玩家$B$获胜）来确定。我们专注于符号动力学游戏，其中的目标集是一个subshift。我们调查的目标子转移和一组转向订单之间的关系，其中$A$有一个获胜的战略。
英文摘要：
We study the class of word-building games, where two players pick letters from a finite alphabet to construct a finite or infinite word. The outcome is determined by whether the resulting word lies in a prescribed set (a win for player $A$) or not (a win for player $B$). We focus on symbolic dynamical games, where the target set is a subshift. We investigate the relation between the target subshift and the set of turn orders for which $A$ has a winning strategy.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
