m-recognizability of sets closed under certain affine functions (Q1824406)

Let S be a set of nonnegative integers and A a finite set of affine functions where each \(\alpha\in A\) is defined as follows \(\alpha (x)=m^ px+a\), \(p\geq 1\), \(a\geq 0\) and \(m\geq 2\). The set S is said to be an m- recognizable set just, when the m-ary strings representing elements of S are recognized by some finite automaton. The main result of this paper is the following: If S is an m-recognizable set then A-closure of S is also m-recognizable.