Logg Inn
innsikt - Decidability of Sturmian Words
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.
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.
Sturmian Words Decidability Study
The first-order theory of Sturmian words over Presburger arithmetic is decidable.
Produkter | Ressurser
© 2024 by Linnk AI