From combinatorial games to shape-symmetric morphisms
From MaRDI portal
Recommendations
- A morphic approach to combinatorial games: the Tribonacci case
- On the geometry of combinatorial games: a renormalization approach
- scientific article; zbMATH DE number 815555
- Patterns in the generalized Fibonacci word, applied to games
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
Cites work
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- A generalization of automatic sequences
- A mathematical investigation of games of “take-away”
- A morphic approach to combinatorial games: the Tribonacci case
- A Second Course in Formal Languages and Automata Theory
- Abstract numeration systems
- Abstract numeration systems on bounded languages and multiplication by a constant
- Additive periodicity of the Sprague-Grundy function of certain Nim games
- Advanced graph theory and combinatorics
- Asymptotic properties of free monoid morphisms
- Automatic Sequences
- Automaticity of double sequences generated by one-dimensional linear cellular automata
- Bases and ambiguity of number systems
- Bertrand numeration systems and recognizability
- Binomial coefficients, valuations, and words
- Cobham's theorem for substitutions
- Combinatorial game theory
- Complementary iterated floor words and the Flora game
- Complexity, appeal and challenges of combinatorial games
- Cubic pisot unit combinatorial games
- Elements of automata theory. Translated from the French by Reuben Thomas
- Enumeration and decidable properties of automatic sequences
- Euclid and Wythoff games
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
- Formal Languages, Automata and Numeration Systems 1
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Generalization of automatic sequences for numeration systems on a regular language
- Generalized Pascal triangle for binomial coefficients of words
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- scientific article; zbMATH DE number 3124339 (Why is no real title available?)
- scientific article; zbMATH DE number 5605083 (Why is no real title available?)
- scientific article; zbMATH DE number 5145315 (Why is no real title available?)
- scientific article; zbMATH DE number 5707089 (Why is no real title available?)
- scientific article; zbMATH DE number 3931097 (Why is no real title available?)
- scientific article; zbMATH DE number 4021221 (Why is no real title available?)
- scientific article; zbMATH DE number 4065109 (Why is no real title available?)
- scientific article; zbMATH DE number 168432 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1740032 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1142311 (Why is no real title available?)
- scientific article; zbMATH DE number 1958322 (Why is no real title available?)
- scientific article; zbMATH DE number 1990000 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1879188 (Why is no real title available?)
- scientific article; zbMATH DE number 1916667 (Why is no real title available?)
- Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture
- Invariant games
- Limit sets of automatic sequences.
- Linear cellular automata, finite automata and Pascal's triangle
- Logic and p-recognizable sets of integers
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- Nonhomogeneous Beatty sequences leading to invariant games
- Numeration systems on a regular language
- Numeration systems: a link between number theory and formal language theory
- On synchronized sequences and their separators
- On the base-dependence of sets of numbers recognizable by finite automata
- On the sequentiality of the successor function
- On the simplification of infinite morphic words
- On uniform recurrence of a direct product
- Pascal's triangle, complexity and automata
- Rational transductions and complexity of counting problems
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA I
- Substitutions in dynamics, arithmetics and combinatorics
- Suites algébriques, automates et substitutions
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- The Bracket Function and Complementary Sets of Integers
- The monadic theory of morphic infinite words and generalizations
- The ring of k-regular sequences
- The ring of \(k\)-regular sequences. II.
- The signature of rational languages
- The Sprague-Grundy function for Wythoff's game
- The theory of graphs. Translated from the 1958 French edition by Alison Doig.
- Trees and languages with periodic signature
- Uniform tag sequences
- Winning ways for your mathematical plays. Vol. 1.
Cited in
(3)
This page was built for publication: From combinatorial games to shape-symmetric morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141334)
