Abstract numeration systems on bounded languages and multiplication by a constant

Emilie Charlier, Michel Rigo, Wolfgang Steiner

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abs…