The study focuses on the decidability of the first-order theory of Sturmian words over Presburger arithmetic. It shows that the theory is decidable and provides insights into the automatic reproval of classical theorems about Sturmian words. The research extends to quadratic numbers and Ostrowski numeration systems, demonstrating the uniformity of automata and the decidability of related theories. The content delves into #-binary encoding, Ostrowski representations, and the alignment of representations, showcasing the ω-regularity of sets and the bijectivity of functions mapping representations to numbers.
Sang ngôn ngữ khác
từ nội dung nguồn
arxiv.org
Thông tin chi tiết chính được chắt lọc từ
by Philipp Hier... lúc arxiv.org 03-06-2024
https://arxiv.org/pdf/2102.08207.pdfYêu cầu sâu hơn