Let

be a finite set of integers and

be a finite set of
maps of the form

with integer
coefficients. For an integer base

, we study the

-recognizability of the minimal set

of integers containing

and satisfying

for all

.
We answer an open problem of Garth and Gouge by showing that

is

-recognizable when the multiplicative constants

are all powers of

and additive constants

are chosen freely.
Moreover, solving a conjecture of Allouche, Shallit and Skordev, we
prove under some technical conditions that if two of the constants

are multiplicatively independent, then

is not

-recognizable for any

.