no code implementations • 16 Feb 2021 • Philipp Hieronymi, Dun Ma, Reed Oei, Luke Schaeffer, Christian Schulz, Jeffrey Shallit
We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable.
Logic in Computer Science Combinatorics Logic
