The Monadic Theory of Toric Words
Abstract
For which unary predicates P1, …, Pm is the MSO theory of the structure N; <, P1, …, Pm 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 Pi can be generated by a toric dynamical system of a certain kind, then the attendant MSO theory is decidable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.