Abstract
We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension . In particular, we prove that the factorization problem is -complete and the conjugacy problem -complete in the arithmetical hierarchy.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.