1 paper
Philipp Hieronymi, Dun Ma, Reed Oei +3
We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwa…