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.
다른 언어로
소스 콘텐츠 기반
arxiv.org
더 깊은 질문