Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type

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 of finite type (SFTs) in dimension d > 1. In particular, we prove that the factorization problem is Σ03-complete and that the conjugacy and embedding problems are Σ01-complete in the arithmetical hierarchy.
Fichier principal
Vignette du fichier
conf-arxiv.pdf (533.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00690285 , version 1 (23-04-2012)

Identifiers

Cite

Emmanuel Jeandel, Pascal Vanier. Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type. STACS 2013 - 30th International Symposium on Theoretical Aspects of Computer Science, Christian-Albrechts - Universität zu Kiel, Feb 2013, Kiel, Germany. pp.490--501, ⟨10.4230/LIPIcs.STACS.2013.490⟩. ⟨hal-00690285⟩
261 View
46 Download

Altmetric

Share

Gmail Facebook X LinkedIn More