11 citations · 13 across the 6 of their papers we have counts for
4 papers · 1 filter
Syndeticity and independent substitutions
Fabien Durand, Michel Rigo
We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the no…
A note on syndeticity, recognizable sets and Cobham's theorem
M. Rigo, L. Waxweiler
In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-reco…
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
J. Bell, E. Charlier, A. S. Fraenkel +1
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over without two consecutive…
Multidimensional Generalized Automatic Sequences and Shape-symmetric Morphic Words
Emilie Charlier, Tomi Karki, Michel Rigo
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 syst…