Hardness of conjugacy and factorization of multidimensional subshifts of finite type
Abstract
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 03-complete and the conjugacy problem 01-complete in the arithmetical hierarchy.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.