[en] The language of a numeration system is the set of representations of all the natural numbers. Depending on the numeration system, this language may or may not be regular. In 1998, Hollander provided some necessary and some sufficient conditions for the regularity of this language, in the case where this language has a dominant root. However, these conditions do not cover all possible cases. In this presentation, we complete Hollander's work and provide a criterion for regularity in the remaining case within the dominant root case. Joint work with Émilie Charlier.
