B3 Non-refereed article in a conference publication
Playing with Subshifts
Authors: Ville Salo, Ilkka Törmä
Editors: Vesa Halava, Juhani Karhumäki, Yuri Matiyasevich
Publishing place: Turku
Publication year: 2012
Journal: TUCS Lecture Notes
Book title : Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics
Series title: TUCS Lecture Notes
First page : 162
Last page: 169
ISSN: 1797-8823
Abstract
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.
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.
UTU Research Portal