4 papers
Variants of Wythoff game with terminal positions or blocking maneuvers
Antoine Renard, Michel Rigo
We show how the software Walnut can be used to obtain concise proofs of results concerning variants of the famous Wythoff game, in which blocking maneuvers or terminal positions ar…
Computing Expansions in Infinitely Many Cantor Real Bases via a Single Transducer
Ãmilie Charlier, Pierre Popoli, Michel Rigo
Representing real numbers using convenient numeration systems (integer bases, -numeration, Cantor bases, etc.) has been a longstanding mathematical challenge. This paper focuse…
Computing the k-binomial complexity of generalized Thue--Morse words
M. Golafshan, M. Rigo, M. Whiteland
Two finite words are k-binomially equivalent if each subword (i.e., subsequence) of length at most k occurs the same number of times in both words. The k-binomial complexity of an…
Introducing q-deformed binomial coefficients of words
Antoine Renard, Michel Rigo, Markus A. Whiteland
Gaussian binomial coefficients are q-analogues of the binomial coefficients of integers. On the other hand, binomial coefficients have been extended to finite words, i.e., elements…