From Combinatorial Games to Shape-Symmetric Morphisms
From MaRDI portal
Publication:5141334
DOI10.1007/978-3-030-57666-0_5zbMath1457.91116OpenAlexW2768551326MaRDI QIDQ5141334
Publication date: 18 December 2020
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://orbi.uliege.be/handle/2268/216249
Combinatorics on words (68R15) Combinatorial games (91A46) Algorithmic game theory and complexity (91A68)
Related Items
Cites Work
- Asymptotic properties of free monoid morphisms
- Generalized Pascal triangle for binomial coefficients of words
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- Trees and languages with periodic signature
- Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture
- Cobham's theorem for substitutions
- Substitutions in dynamics, arithmetics and combinatorics
- The signature of rational languages
- Bases and ambiguity of number systems
- The Sprague-Grundy function for Wythoff's game
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- Invariant games
- On the simplification of infinite morphic words
- Cubic pisot unit combinatorial games
- A generalization of automatic sequences
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- The ring of \(k\)-regular sequences
- Pascal's triangle, complexity and automata
- Additive periodicity of the Sprague-Grundy function of certain Nim games
- Logic and \(p\)-recognizable sets of integers
- On the sequentiality of the successor function
- Automaticity of double sequences generated by one-dimensional linear cellular automata
- Bertrand numeration systems and recognizability
- The ring of \(k\)-regular sequences. II.
- Generalization of automatic sequences for numeration systems on a regular language
- The monadic theory of morphic infinite words and generalizations
- Limit sets of automatic sequences.
- Complexity, appeal and challenges of combinatorial games
- Linear cellular automata, finite automata and Pascal's triangle
- Binomial coefficients, valuations, and words
- Euclid and Wythoff games
- Nonhomogeneous Beatty Sequences Leading to Invariant Games
- Formal Languages, Automata and Numeration Systems 1
- Advanced Graph Theory and Combinatorics
- On synchronized sequences and their separators
- A morphic approach to combinatorial games: the Tribonacci case
- A Second Course in Formal Languages and Automata Theory
- Numeration Systems: A Link between Number Theory and Formal Language Theory
- Suites algébriques, automates et substitutions
- Automatic Sequences
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- Rational transductions and complexity of counting problems
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- Formal Languages, Automata and Numeration Systems 2
- Complementary Iterated Floor Words and the Flora Game
- Abstract numeration systems
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA I
- A mathematical investigation of games of “take-away”
- The Bracket Function and Complementary Sets of Integers
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Numeration systems on a regular language
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
