Currently displaying 1 – 7 of 7

Showing per page

Order by Relevance | Title | Year of publication

A morphic approach to combinatorial games : the Tribonacci case

Eric DuchêneMichel Rigo — 2008

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We propose a variation of Wythoff’s game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word for the two piles game. Thanks to the corresponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time.

Abstract β -expansions and ultimately periodic representations

Michel RigoWolfgang Steiner — 2005

Journal de Théorie des Nombres de Bordeaux

For abstract numeration systems built on exponential regular languages (including those coming from substitutions), we show that the set of real numbers having an ultimately periodic representation is ( β ) if the dominating eigenvalue β > 1 of the automaton accepting the language is a Pisot number. Moreover, if β is neither a Pisot nor a Salem number, then there exist points in ( β ) which do not have any ultimately periodic representation.

A morphic approach to combinatorial games: the Tribonacci case

Eric DuchêneMichel Rigo — 2007

RAIRO - Theoretical Informatics and Applications

We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word for the two piles game. Thanks to the corresponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time.

A Characterization of Multidimensional S -Automatic Sequences

Emilie CharlierTomi KärkiMichel Rigo — 2009

Actes des rencontres du CIRM

An infinite word is S -automatic if, for all n 0 , its ( n + 1 ) st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S . In this extended abstract, we consider an analogous definition in a multidimensional setting and present the connection to the shape-symmetric infinite words introduced by Arnaud Maes. More precisely, for d 2 , we state that a multidimensional infinite word x : d Σ over a finite alphabet Σ is S -automatic for some abstract numeration...

Page 1

Download Results (CSV)