Playing with Subshifts

DOI10.3233/FI-2014-1037zbMATH Open1302.68230arXiv1310.0650OpenAlexW3099795051MaRDI QIDQ2934879FDOQ2934879

Ville Salo, Ilkka A. Törmä

Publication date: 22 December 2014

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1310.0650

zbMATH Keywords

entropyperfect informationgamessubshifts

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Noncooperative games (91A10) Symbolic dynamics (37B10) Combinatorics on words (68R15) Descriptive set theory (03E15)

Cited In (5)

• On subshift presentations
• On winning shifts of marked uniform substitutions
• Title not available (Why is that?)
• Automatic winning shifts
• Rotating-table games and derivatives of words

This page was built for publication: Playing with Subshifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934879)