Decidability for Sturmian words
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 Baranwal, Schaeffer and Shallit, we prove that the first-order expansions of Presburger arithmetic by a single Sturmian word ar...
Spremljeno u:
| Glavni autori: | , , , , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Logical Methods in Computer Science e.V.
2024-08-01
|
| Serija: | Logical Methods in Computer Science |
| Teme: | |
| Online pristup: | http://lmcs.episciences.org/9980/pdf |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|