Finite entropy for multidimensional cellular automata

DOI10.1017/S0143385707000855zbMath1152.37009arXivmath/0703167MaRDI QIDQ3528760

Tom Meyerovitch

Publication date: 17 October 2008

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0703167

zbMATH Keywords

cellular automata; topological entropy; tiling system

Mathematics Subject Classification ID

37B15: Dynamical aspects of cellular automata

Related Items

Amenability of Groups and G-Sets, Unnamed Item, Rescaled entropy of cellular automata, The Entropy and Reversibility of Cellular Automata on Cayley Tree, Dynamics and topological entropy of 1D Greenberg–Hastings cellular automata, Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues, Growth-type invariants for \(\mathbb Z^{d}\) subshifts of finite type and arithmetical classes of real numbers, Gardens of Eden and amenability on cellular automata, On the conjugacy problem of cellular automata, Amenability of groups is characterized by Myhill's theorem

Cites Work

• Topological and measure-theoretic properties of one-dimensional cellular automata
• Matching rules and substitution tilings
• Ergodic theory on compact spaces
• Entropy bounds for endomorphisms commuting with \(k\) actions
• Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms
• Reversibility and surjectivity problems of cellular automata
• On computing the entropy of cellular automata.
• On multidimensional curves with Hilbert property
• Theory of cellular automata: a survey
• Undecidability and nonperiodicity for tilings of the plane
• Endomorphisms and automorphisms of the shift dynamical system
• Cellular automata: From a theoretical parallel computational model to its application to complex systems