You are here: TUCS > PUBLICATIONS > Publication Search > Playing with Subshifts
Playing with Subshifts
Ville Salo, Ilkka Törmä, Playing with Subshifts. In: Vesa Halava, Juhani Karhumäki, Yuri Matiyasevich (Eds.), Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics, TUCS Lecture Notes 17, 162–169, Juvenes Print, 2012.
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:
@INPROCEEDINGS{inpSaTx12f,
title = {Playing with Subshifts},
booktitle = {Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics},
author = {Salo, Ville and Törmä, Ilkka},
volume = {17},
series = {TUCS Lecture Notes},
editor = {Halava, Vesa and Karhumäki, Juhani and Matiyasevich, Yuri},
publisher = {Juvenes Print},
pages = {162–169},
year = {2012},
keywords = {subshifts, symbolic dynamics, infinite games, perfect information},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics