You are here: TUCS > PUBLICATIONS > Publication Search > Playing with Subshifts
Playing with Subshifts
Ville Salo, Ilkka Törmä, Playing with Subshifts. Fundamenta Informaticae 132(1), 131–152, 2014.
http://dx.doi.org/10.3233/FI-2014-1037
Abstract:
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.
BibTeX entry:
@ARTICLE{jSaTx14a,
title = {Playing with Subshifts},
author = {Salo, Ville and Törmä, Ilkka},
journal = {Fundamenta Informaticae},
volume = {132},
number = {1},
publisher = {IOS Press},
pages = {131–152},
year = {2014},
keywords = {subshifts, games, perfect information, entropy},
ISSN = {0169-2968},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics
Publication Forum rating of this publication: level 2