有限型多维子移位的共轭性和因式分解的困难性
Hardness of conjugacy and factorization of multidimensional subshifts of finite type
摘要:
本文研究了维数为$d>1$的有限型子移位的共轭性和因式分解的困难性。特别地,我们证明了在算术层次上,因式分解问题是$Σ^0_3$ -完全的,共轭问题是$Σ^0_1$ -完全的.
英文摘要:
We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular, we prove that the factorization problem is $Σ^0_3$-complete and the conjugacy problem $Σ^0_1$-complete in the arithmetical hierarchy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。