Two applications of the spectrum of numbers (Q1715009)

Let $$S_A(\beta)=\left\{\sum_{k=0}^n\alpha_k\beta^k\mid n\in\mathbb{N},\ \alpha_k\in A\right\},$$ be the $A$-spectrum of a complex number $\beta$, $\vert \beta>1$, where $A\subset C$ is a finite alphabet of digits. The aim of the present paper is to study the solution of two problems arising in the so-called beta-numeration introduced by A. Rényi and studied by W. Parry in the case that $\beta$ is a number, $\beta>1$, by using the concept of spectrum of a number. In particular the authors managed to prove that the spectrum $S_A(\beta)$ has an accumulation point if and only if 0 has a rigid $(\beta,A)$ representation and to obtain some results-applications in the case that the base is a complex Pisot number. The first application restricted to the case $\beta>1$, where the alphabet is $A=\{-M,\ldots,M\}$, for an integer $M\geq 1$ shows that in general the set $$Z_{\beta,M}=\left\{z_1z_2\ldots \mid \sum_{i\geq 1}z_i\beta^{-i},z_i\in \{-M,\ldots,M\}\right\}$$ of finite $(\beta,A)$-representation of 0 is recognizable by a finite Büchi automaton if and only if the spectrum $S_A(\beta)$ has no accumulation point. For the second application the utilization of the spectrum $S_A(\beta)$ occurs in the on-line algorithm for division in a complex base showing that $(\beta,A)$-representaion allows preprocessing if and only if the spectrum $S_A(\beta)$ has no accumulation point.