2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30932Let U be a numeration system, a set X of integers is U-star-free if the set made up of the U-representations of the elements in X is a star-free regular language. Answering a question of A. de Luca and A. Restivo, we obtain a complete logical characterization of the U-star-free sets of integers for suitable numeration systems related to a Pisot number and in particular for integer base systems. For these latter systems, we study as well the problem of the base dependence. Finally, the case of k-adic systems is also investigated.15 pages, 4 figuresComputational ComplexityLogic in Computer ScienceF.1.1;F.4.1;F.4.3text