Hardness of conjugacy, embedding and factorization of multidimensional subshifts
type: Item
instance of: scholarly article
title: Hardness of conjugacy, embedding and factorization of multidimensional subshifts
zbMATH Open document ID: 1328.68074
author: Emmanuel Jeandel
author: Pascal Vanier
published in: Journal of Computer and System Sciences
publication date: 2015-08-31T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 37B50
zbMATH DE Number: 6476952
zbMATH Keywords: subshifts
zbMATH Keywords: computability
zbMATH Keywords: factorization
zbMATH Keywords: embedding
zbMATH Keywords: conjugacy
zbMATH Keywords: subshift of finite type
zbMATH Keywords: arithmetical hierarchy
zbMATH Keywords: tilings
zbMATH Keywords: SFTs
MaRDI profile type: Publication
full work available at URL: j.jcss.2015.05.003
OpenAlex ID: W567294561
cites work: Simulation of effective subshifts by two-dimensional subshifts of finite type
cites work: On Factor Universality in Symbolic Spaces
cites work: Lower entropy factors of sofic systems
cites work: Q3545300
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: A note on universality in multidimensional symbolic dynamics
cites work: On the dynamics and recursive properties of multidimensional symbolic systems
cites work: $\it \Pi^0_1$ Sets and Tilings
cites work: Q2957910
cites work: Theory of computation.
cites work: On the subsystems of topological Markov chains
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Q4668496
cites work: Undecidability and nonperiodicity for tilings of the plane
cites work: Q5573961
cites work: Classification of subshifts of finite type
DOI: 10.1016/J.JCSS.2015.05.003
description: scientific article; zbMATH DE number 6476952