Deciding game invariance

DOI10.1016/j.ic.2017.01.010zbMath1410.91126arXiv1408.5274OpenAlexW2962983538MaRDI QIDQ515578

Michel Rigo, Eric Duchêne, Aline Parreau

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

first-order logicdecision problemcombinatorial gameimpartial gamerecognizable sets of integers

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorial games (91A46)

Related Items (2)

Adjoining to (K,s,t)-Wythoff's game its P-generators as moves ⋮ Rulesets for Beatty games

Uses Software

• Walnut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From heaps of matches to the limits of computability
• Two variants of Wythoff's game preserving its \(\mathcal P\)-positions
• Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture
• Aperiodic subtraction games
• Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
• Invariant games
• Cubic pisot unit combinatorial games
• Heap games, numeration systems and sequences
• Logic and \(p\)-recognizable sets of integers
• On the sequentiality of the successor function
• Bertrand numeration systems and recognizability
• Nonhomogeneous Beatty Sequences Leading to Invariant Games
• Automatic Theorem-Proving in Combinatorics on Words
• On synchronized sequences and their separators
• Decision algorithms for Fibonacci-automatic Words, I: Basic results
• Weak Second‐Order Arithmetic and Finite Automata
• Mechanical Proofs of Properties of the Tribonacci Word
• A morphic approach to combinatorial games: the Tribonacci case
• Systems of Numeration
• Representations of numbers and finite automata
• ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
• Formal Languages, Automata and Numeration Systems 2

This page was built for publication: Deciding game invariance