登录
洞察 - Decidability of Sturmian Words
Sturmian Words Decidability Study
The first-order theory of Sturmian words over Presburger arithmetic is decidable.
Sturmian Words: Decidability and Automata
The first-order theory of Sturmian words over Presburger arithmetic is decidable, allowing for automatic reproval of classical theorems and new results.
Decidability of Sturmian Words in Presburger Arithmetic
The author demonstrates the decidability of the first-order theory of Sturmian words over Presburger arithmetic, showcasing the uniform ω-automaticity of their expansions.
