2 papers
cs.FL2009
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…
cs.FL2009
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…