On the dynamics and recursive properties of multidimensional symbolic systems
From MaRDI portal
Publication:1016235
DOI10.1007/s00222-008-0161-7zbMath1168.37002MaRDI QIDQ1016235
Publication date: 5 May 2009
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00222-008-0161-7
68Q80: Cellular automata (computational aspects)
37B15: Dynamical aspects of cellular automata
37B40: Topological entropy
Related Items
Mixing properties of tree-shifts, Probability and algorithmics: a focus on some recent developments, About the Domino Problem for Subshifts on Groups, Characterization of sets of limit measures of a cellular automaton iterated on a random configuration, Zero-temperature phase diagram for double-well type potentials in the summable variation class, A class of nonsofic multidimensional shift spaces, On the finite-dimensional marginals of shift-invariant measures, Multidimensional sofic shifts without separation and their factors, Unnamed Item, The expressiveness of quasiperiodic and minimal shifts of finite type, Support stability of maximizing measures for shifts of finite type, Subshifts with sparse traces, The Undecidability of the Domino Problem, Decidability in Group Shifts and Group Cellular Automata, Ergodic optimization in dynamical systems, A generalization of the simulation theorem for semidirect products, Weak colored local rules for planar tilings, On the Expressive Power of Quasiperiodic SFT., Classification of sofic projective subdynamics of multidimensional shifts of finite type, Matrix Characterization of Multidimensional Subshifts of Finite Type, On the Besicovitch-stability of noisy random tilings, Random \(\mathbb{Z}^d\)-shifts of finite type, Simulation of effective subshifts by two-dimensional subshifts of finite type, Fixed-point tile sets and their applications, The structure of limit sets for \(\mathbb{Z}^d\) actions, Hardness of conjugacy, embedding and factorization of multidimensional subshifts, A notion of effectiveness for subshifts on finitely generated groups, Growth-type invariants for \(\mathbb Z^{d}\) subshifts of finite type and arithmetical classes of real numbers, Polyominoes simulating arbitrary-neighborhood zippers and tilings, Computability of countable subshifts in one dimension, Geometric rigidity of \(\times m\) invariant measures, On the zero-temperature limit of Gibbs states, Seas of squares with sizes from a \(\Pi_{1}^{0}\) set, Realization of aperiodic subshifts and uniform densities in groups, Effect of quantified irreducibility on the computability of subshift entropy, The work of Mike Hochman on multidimensional symbolic dynamics and Borel dynamics, Characterizing entropy dimensions of minimal mutidimensional subshifts of finite type, Quantified block gluing for multidimensional subshifts of finite type: aperiodicity and entropy, A strongly aperiodic shift of finite type on the discrete Heisenberg group using Robinson tilings, Entropy dimension of shifts of finite type on free groups, Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts, Computability of topological entropy: from general systems to transformations on Cantor sets and the interval, Countable sofic shifts with a periodic direction, Slopes of multidimensional subshifts, Lectures on dynamics, fractal geometry, and metric number theory, Entropies realizable by block gluing \(\mathbb{Z}^{d}\) shifts of finite type, Turing degree spectra of minimal subshifts, Decidability and universality of quasiminimal subshifts, Factor maps and embeddings for random \(\mathbb{Z}^d\) shifts of finite type, Extender sets and multidimensional subshifts, Rohlin properties for $\mathbb{Z}^{d}$ actions on the Cantor set, One-dimensional projective subdynamics of uniformly mixing shifts of finite type, Effective S-adic Symbolic Dynamical Systems, Computability in Symbolic Dynamics, Conservatively Approximable Functions, On the automorphism groups of multidimensional shifts of finite type, Embeddings of dynamical systems into cellular automata – ERRATUM, Effective Closed Subshifts in 1D Can Be Implemented in 2D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the entropy of \(\mathbb{Z}^d\) subshifts of finite type
- Computation theoretic aspects of cellular automata
- How sampling reveals a process
- A characterization of the entropies of multidimensional shifts of finite type
- A simple measure-preserving transformation with trivial centralizer
- Rice's theorem for the limit sets of cellular automata
- Dynamical properties of expansive one-sided cellular automata
- Expansive invertible onesided cellular automata
- Theory of cellular automata: a survey
- Tilings, substitution systems and dynamical systems generated by them
- The Arithmetical Hierarchy of Real Numbers
- The entropies of topological Markov shifts and a related class of algebraic integers
- shifts of finite type without equal entropy full shift factors
- The topological entropy of cellular automata is uncomputable
- Nonrecursive tilings of the plane. II
- Non-uniqueness of measures of maximal entropy for subshifts of finite type
- Entropy gaps and locally maximal entropy in $\mathbb{Z}^d$ subshifts
- Textile systems and one-sided resolving automorphisms and endomorphisms of the shift
- Factoring higher-dimensional shifts of finite type onto the full shift
- Endomorphisms and automorphisms of the shift dynamical system
- The undecidability of the domino problem
- Machines, Computations, and Universality
