Automatic winning shifts
From MaRDI portal
Publication:2672264
DOI10.1016/j.ic.2022.104883OpenAlexW4213441681MaRDI QIDQ2672264
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.07249
regular languagesofic shiftautomatic sequencecombinatorial gameabstract numeration systemwinning shift
Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85) Combinatorial games (91A46) Multidimensional shifts of finite type (37B51)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equations for regular languages, finite automata, and sequential networks
- Alternating finite automata on \(\omega\)-words
- Logic and \(p\)-recognizable sets of integers
- Shattering news
- STACS 98. 15th annual symposium on theoretical aspects of computer science. Paris, France, February 25--27, 1998. Proceedings
- On the sequentiality of the successor function
- Topological entropy and distributional chaos in hereditary shifts with applications to spacing shifts and beta shifts
- Automatic sequences based on Parry or Bertrand numeration systems
- Descriptional complexity of winning sets of regular languages
- Regular sequences and synchronized sequences in abstract numeration systems
- Independence in topological and \(C^*\)-dynamics
- Multi-dimensional sets recognizable in all abstract numeration systems
- Playing with Subshifts
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- Representations of numbers and finite automata
- Automatic Sequences
- An Introduction to Symbolic Dynamics and Coding
- On winning shifts of marked uniform substitutions
- Formal Languages, Automata and Numeration Systems 2
- AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
- A helpful result for proving inherent ambiguity
- Numeration systems on a regular language
This page was built for publication: Automatic winning shifts
