The monadic theory of toric words
Year: 2024
Type: article
Abstract: For which unary predicates P 1 , … , P m is the MSO theory of the structure 〈 N ; < , P 1 , … , P m 〉 decidable? We survey the state of the art, leading us to investigate combinatorial properties of almost-periodic, morphic, and toric words. In doing so, we show that if each P i can be generated by a toric dynamical system of a certain kind, then the attendant MSO theory is decidable. We give various applications of toric words, including the recent result of [1] that the MSO theory of 〈 N ; < , { 2 n : n ∈ N } , { 3 n : n ∈ N } 〉 is decidable.
Source: Theoretical Computer Science
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,800
OpenAlex ID: W4404356906