Hardness of conjugacy, embedding and factorization of multidimensional subshifts
From MaRDI portal
Publication:494068
DOI10.1016/j.jcss.2015.05.003zbMath1328.68074OpenAlexW567294561MaRDI QIDQ494068
Emmanuel Jeandel, Pascal Vanier
Publication date: 31 August 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.05.003
embeddingconjugacysubshift of finite typefactorizationtilingscomputabilitysubshiftsarithmetical hierarchySFTs
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Arithmetical hierarchy of the Besicovitch-stability of noisy tilings ⋮ Computational complexity of \(k\)-block conjugacy ⋮ Decidability of irreducible tree shifts of finite type ⋮ Optimal state amalgamation is NP-hard
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- A note on universality in multidimensional symbolic dynamics
- On the dynamics and recursive properties of multidimensional symbolic systems
- Classification of subshifts of finite type
- Theory of computation.
- Undecidability and nonperiodicity for tilings of the plane
- $\it \Pi^0_1$ Sets and Tilings
- Lower entropy factors of sofic systems
- On Factor Universality in Symbolic Spaces
- On the subsystems of topological Markov chains
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Hardness of conjugacy, embedding and factorization of multidimensional subshifts
