14 citations · 54 across the 28 of their papers we have counts for
38 papers
On extended boundary sequences of morphic and Sturmian words
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Generalizing the notion of the boundary sequence introduced by Chen and Wen, the th term of the -boundary sequence of an infinite word is the finite set of pairs o…
On digital sequences associated with Pascal's triangle
Pierre Mathonet, Michel Rigo, Manon Stipulanti +1
We consider the sequence of integers whose th term has base- expansion given by the th row of Pascal's triangle modulo (where is a prime number). We first present…
Characterizations of families of morphisms and words via binomial complexities
Michel Rigo, Manon Stipulanti, Markus A. Whiteland
Two words are -binomially equivalent if each subword of length at most occurs the same number of times in both words. The -binomial complexity of an infinite word is a co…
Revisiting regular sequences in light of rational base numeration systems
Michel Rigo, Manon Stipulanti
Regular sequences generalize the extensively studied automatic sequences. Let be an abstract numeration system. When the numeration language is prefix-closed and regular, a…
Automatic sequences: from rational bases to trees
Michel Rigo, Manon Stipulanti
The th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of in a suitable numeration system. In this paper, instead…
Ultimate periodicity problem for linear numeration systems
E. Charlier, A. Massuir, M. Rigo +1
We address the following decision problem. Given a numeration system and a -recognizable set , i.e. the set of its greedy -representations is recogn…