Hardness of conjugacy and factorization of multidimensional subshifts of finite type

Details Hardness of conjugacy and factorization of multidimensional subshifts of finite type Hardness of conjugacy and factorization of multidimensional subshifts of finite type

2012-04-23

arxiv.org/abs/1204.4988v1

Computer Science

Discrete Mathematics

Scientific paper

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 $\Sigma^0_3$-complete and the conjugacy problem
$\Sigma^0_1$-complete in the arithmetical hierarchy.

Affiliated with

Also associated with

No associations

Rating

Hardness of conjugacy and factorization of multidimensional subshifts of finite type does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hardness of conjugacy and factorization of multidimensional subshifts of finite type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardness of conjugacy and factorization of multidimensional subshifts of finite type will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-443621