Playing with Subshifts
arXiv:1310.0650 · doi: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 ) or not (a win for player ). 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 has a winning strategy.
22 pages, 4 figures. To appear in Fundamenta Informaticae