加载中…
We show that the sets of periods of multidimensional shifts of finite type (SFTs) are exactly the sets of integers of the complexity class . We also show that the functions counting their number are the functions of #E. We also give characterizations of some other notions of periodicity. We finish the paper by giving some characterizations for sofic and effective subshifts.

生成讲解博客的中文版本

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