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...
Na minha lista:
| Principais autores: | , , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Logical Methods in Computer Science e.V.
2024-08-01
|
| Colecção: | Logical Methods in Computer Science |
| Assuntos: | |
| Acesso em linha: | http://lmcs.episciences.org/9980/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|