On winning shifts of marked uniform substitutions

DOI10.1051/ita/2018007zbMath1425.68335arXiv1705.08747OpenAlexW3105293303WikidataQ128593833 ScholiaQ128593833MaRDI QIDQ5223831

Ville Salo, Jarkko Peltomäki

Publication date: 18 July 2019

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

factor complexitygeneralized Thue-Morse wordmarked substitutiontwo-player game, winning shift

Mathematics Subject Classification ID

Applications of statistical and quantum mechanics to economics (econophysics) (91B80) Combinatorics on words (68R15)

Related Items (2)

Automatic winning shifts ⋮ Unnamed Item

Cites Work

• Subword complexity of a generalized Thue-Morse word
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Power of words and recognizability of fixpoints of a substitution
• Shattering news
• Enumeration of factors in the Thue-Morse word
• Playing with Subshifts
• Generalized Thue-Morse words and palindromic richness
• Factor frequencies in generalized Thue-Morse words
• Automatic Sequences
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On winning shifts of marked uniform substitutions