加载中…
For which unary predicates is the MSO theory of the structure 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 can be generated by a toric dynamical system of a certain kind, then the attendant MSO theory is decidable.

生成讲解博客的中文版本

生成AI智能校验的中文版本