Playing with Subshifts



: Ville Salo, Ilkka Törmä

: Vesa Halava, Juhani Karhumäki, Yuri Matiyasevich

: Turku

: 2012

: TUCS Lecture Notes

: Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics

: TUCS Lecture Notes

: 162

: 169

: 1797-8823


We study the class of sequence-building games, where two players pick letters from a finite alphabet to construct an infinite word. The outcome is determined by whether the resulting word lies in a prescribed subshift (a win for player A) or not (a win for player B). We investigate the relation between the target subshift and the set of turn orders for which A has a winning strategy.



Last updated on 2024-26-11 at 17:32