Hardness of conjugacy, embedding and factorization of multidimensional subshifts

Abstract : Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts in dimensions $d > 1$ for subshifts of finite type and sofic shifts and in dimensions $d\geq 1$ for effective shifts. In particular, we prove that the factorization and embedding problems are $\Sigma^0_3$ -complete and $\Sigma^0_1$- complete respectively for SFTs, sofic and effective subshifts. Conjugacy on the other side is $\Sigma^0_1$-complete for SFTs and $\Sigma^0_3$-complete for sofic and effective shifts.
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01150419
Contributor : Pascal Vanier <>
Submitted on : Friday, June 12, 2015 - 12:46:02 PM
Last modification on : Tuesday, December 18, 2018 - 4:48:02 PM
Document(s) archivé(s) le : Wednesday, April 19, 2017 - 8:32:40 PM

File

jcss.pdf
Files produced by the author(s)

Identifiers

Citation

Emmanuel Jeandel, Pascal Vanier. Hardness of conjugacy, embedding and factorization of multidimensional subshifts . Journal of Computer and System Sciences, Elsevier, 2015, http://dx.doi.org/10.1016/j.jcss.2015.05.003. ⟨10.1016/j.jcss.2015.05.003⟩. ⟨hal-01150419⟩

Share

Metrics

Record views

330

Files downloads

128