Soient et deux systèmes de numération de Bertrand, et deux -nombres multiplicativement indépendants tels que et , et un sous-ensemble de . Si est -reconnaissable et -reconnaissable alors est une réunion finie de progressions arithmétiques.
In this paper we prove the decidability of the HD0L ultimate periodicity problem.
The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences.
Let and be two multiplicatively independent Perron numbers. Then a sequence , where is a finite alphabet, is both -substitutive and -substitutive if and only if is ultimately periodic....
We study the convergence of the ergodic averages where is a bounded sequence and
a strictly increasing sequence of integers such that for some . Moreover we give explicit such sequences and and we investigate in particular the case where is a -multiplicative
sequence.
Download Results (CSV)