Numeration system; Recognizable sets; Multiplication by a constant
Résumé :
[en] We consider the preservation of recognizability of a set of integers after multiplication by a constant for numeration systems built over a bounded language. As a corollary we show that any nonnegative integer can be written as a sum of binomial coefficients with some prescribed properties.
Disciplines :
Mathématiques
Auteur, co-auteur :
Charlier, Emilie ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Rigo, Michel ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Langue du document :
Anglais
Titre :
Structural properties of bounded languages with respect to multiplication by a constant
