Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Finite entropy for multidimensional cellular automata

View through CrossRef
AbstractLet $X=S^{\mathbb {G}}$ where $\mathbb {G}$ is a countable group and S is a finite set. A cellular automaton (CA) is an endomorphism T:X→X (continuous, commuting with the action of $\mathbb {G}$). Shereshevsky [Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms. Indag. Math. (N.S.)4(2) (1993), 203–210] proved that for $\mathbb {G}=\mathbb {Z}^d$ with d>1 no CA can be forward expansive, raising the following conjecture: for $G=\mathbb {Z}^d$, d>1, the topological entropy of any CA is either zero or infinite. Morris and Ward [Entropy bounds for endomorphisms commuting with K actions. Israel J. Math. 106 (1998), 1–11] proved this for linear CAs, leaving the original conjecture open. We show that this conjecture is false, proving that for any d there exists a d-dimensional CA with finite, non-zero topological entropy. We also discuss a measure-theoretic counterpart of this question for measure-preserving CAs.
Title: Finite entropy for multidimensional cellular automata
Description:
AbstractLet $X=S^{\mathbb {G}}$ where $\mathbb {G}$ is a countable group and S is a finite set.
A cellular automaton (CA) is an endomorphism T:X→X (continuous, commuting with the action of $\mathbb {G}$).
Shereshevsky [Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms.
 Indag.
 Math.
 (N.
S.
)4(2) (1993), 203–210] proved that for $\mathbb {G}=\mathbb {Z}^d$ with d>1 no CA can be forward expansive, raising the following conjecture: for $G=\mathbb {Z}^d$, d>1, the topological entropy of any CA is either zero or infinite.
Morris and Ward [Entropy bounds for endomorphisms commuting with K actions.
 Israel J.
 Math.
 106 (1998), 1–11] proved this for linear CAs, leaving the original conjecture open.
We show that this conjecture is false, proving that for any d there exists a d-dimensional CA with finite, non-zero topological entropy.
We also discuss a measure-theoretic counterpart of this question for measure-preserving CAs.

Related Results

Simulations for Event-Clock Automata
Simulations for Event-Clock Automata
Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically usef...
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
AbstractIn this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, includ...
Freezing, Bounded-Change and Convergent Cellular Automata
Freezing, Bounded-Change and Convergent Cellular Automata
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some o...
Permutation Groups in Automata Diagrams
Permutation Groups in Automata Diagrams
Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types o...
On Computational Power of Partially Blind Automata
On Computational Power of Partially Blind Automata
On Computational Power of Partially Blind Automata In this paper we deal with 1-way multihead finite automata, in which the symbol under only one head (called read head) co...
FUZZY‐FUZZY AUTOMATA
FUZZY‐FUZZY AUTOMATA
Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are inves...
General Fuzzy Finite Switchboard Automata
General Fuzzy Finite Switchboard Automata
The constructions of finite switchboard state automata are known to be an extension of finite automata in the view of commutative and switching state machines. This research incorp...
Minimisation and Language Inclusion for Separating B\"uchi and Parity Automata
Minimisation and Language Inclusion for Separating B\"uchi and Parity Automata
We provide simple proofs of the NC results for the universality, language inclusion, and equivalence problems of unambiguous finite automata, based on recent advances in model chec...

Back to Top