Playing with subshifts

DOI10.3233/FI-2014-1037MaRDI QIDQ2934879zbMATH OpenOpenAlexFDO

Authors Ville Salo, Ilkka A. Törmä

Publication date 22 December 2014

Published in Fundamenta Informaticae (Search for Journal in Brave)

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)

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.

Recommendations

• On winning shifts of marked uniform substitutions
• Automatic winning shifts
• Strategical languages of infinite words
• Languages vs. -languages in regular infinite games
• Languages versus \(\omega\)-languages in regular infinite games

Cited in

(7)

• On subshift presentations
• On winning shifts of marked uniform substitutions
• scientific article; zbMATH DE number 7770053 (Why is no real title available?)
• Two-player domino games
• Automatic winning shifts
• Toward better depth lower bounds: a KRW-like theorem for strong composition
• 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)