Arithmetic Meyer sets and finite automata

In this paper we give a method to construct the sets F and an algorithm, whose complexity is exponential in time and space, to minimize their size. We also give a finite transducer that performs the decomposition of the elements of Zβ-Zβ as a sum belonging to Zβ+F.