Entropy of Cellular Automata
نویسنده
چکیده
Let X = S where 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 G). Shereshevsky [13] proved that for G = Z with d > 1 no CA can be forward expansive, raising the following conjecture: For G = Z, d > 1 the topological entropy of any CA is either zero or infinite. Morris and Ward [10], proved this for linear CA’s, leaving the original conjecture open. We show that this conjecture is false, proving that for any d there exist a d-dimensional CA with finite, nonzero topological entropy. We also discuss a measure-theoretic counterpart of this question for measure-preserving CA’s.
منابع مشابه
On the Rotation Entropy of Additive Cellular Automata
In this paper, we first introduce the definition of rotational sets for cellular automata ∞ using Misiurewicz’s rotational sets. After that, we define rotational entropy functions for cellular automata ∞ from Bowen’s definiton of rotational entropy. Finally, we compare rotational entropy function with topologic entropy function for cellular automata ∞.
متن کاملEntropy and Applications of Cellular Automata
In this paper I will provide an introduction to the theory of cellular automata and review a paper by Michele D’amico, Giovanni Manzini, and Luciano Margara [3], On computing the entropy of cellular automata, in which the authors study the topological entropy of cellular automata. The main problems addressed are proving a closed form for the topological entropy of D-dimensional linear cellular ...
متن کاملEntropy rate of higher-dimensional cellular automata
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift–commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the entropy rate result from basic results about the entropy of partitions of multidimensional cellular automata. We prove several results that show that entropy ...
متن کاملOn Computing the Entropy of Cellular Automata
We study the topological entropy of a particular class of dynamical systems: cellular automata. The topological entropy of a dynamical system (X; F) is a measure of the complexity of the dynamics of F over the space X . The problem of computing (or even approximating) the topological entropy of a given cellular automata is algorithmically undecidable (Ergodic Theory Dynamical Systems 12 (1992) ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007