Additive number theory via automata theory (Q1987517)

In the paper under review, the authors study several problems in additive number theory by using automata theory. In particular they use a result due to \textit{V. Bruyère} et al. [Bull. Belg. Math. Soc. - Simon Stevin 1, No. 2, 191--238 (1994; Zbl 0804.11024)] and its implementation in Mousavi's software ``Walnut''. Using these techniques based on automata theory the authors study the decomposition of integers as a sum or difference of two or three numbers containing an even/odd number of ones in their binary expansion (Theorems 3 and 4). They also consider similar results for expansions based on Fibonacci numbers (Theorem 6). They also prove several results concerning palindormes in base \(3\) and \(4\). In particular they prove (Theorems 13 and 14) that every natural number is the sum of at most three base-\(3\) respectively base-\(3\) palindromes.