Results 1  10
of
24,286
ON THE ERGODIC PROPERTIES OF CERTAIN ADDITIVE CELLULAR AUTOMATA OVER Zm
, 2005
"... Abstract. In this paper, we investigate some ergodic properties of Z 2actions Tp,n generated by an additive cellular automata and shift acting on the space of all doublyinfinitive sequences taking values in Zm. 1. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this paper, we investigate some ergodic properties of Z 2actions Tp,n generated by an additive cellular automata and shift acting on the space of all doublyinfinitive sequences taking values in Zm. 1.
SOME ERGODIC PROPERTIES OF INVERTIBLE CELLULAR AUTOMATA
, 902
"... Abstract. In this paper we consider invertible onedimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality pk, i.e. the maps Tf[l,r] : ZZ pk → ZZ pk which are given by Tf[l,r](x) = (yn) ∞ n=− ∞ , yn = f(xn+l,..., xn+r) = rP λixn+i(mod p i=l k), x = (xn) ∞ ..."
Abstract
 Add to MetaCart
Abstract. In this paper we consider invertible onedimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality pk, i.e. the maps Tf[l,r] : ZZ pk → ZZ pk which are given by Tf[l,r](x) = (yn) ∞ n=− ∞ , yn = f(xn+l,..., xn+r) = rP λixn+i(mod p i=l k), x = (xn
Linear Cellular Automata and Finite Automata
"... Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity
CELLULAR AUTOMATA
, 2008
"... In this lecture I shall present a class of mathematical tools for modeling phenomena that can be described in terms of elementary interacting objects. The goal is to make the macroscopic behavior arise from individual dynamics. I shall ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this lecture I shall present a class of mathematical tools for modeling phenomena that can be described in terms of elementary interacting objects. The goal is to make the macroscopic behavior arise from individual dynamics. I shall
Cellular Automata Workshop 1996
"... We study the evolution of an empty linear sand pile system which receives a sand grain in its first pile each time. We encode it with another cellular automata, the Chip Firing Game. Geometrical observations lead to a signal encoding of configurations. The interactions of signals are studied. Config ..."
Abstract
 Add to MetaCart
We study the evolution of an empty linear sand pile system which receives a sand grain in its first pile each time. We encode it with another cellular automata, the Chip Firing Game. Geometrical observations lead to a signal encoding of configurations. The interactions of signals are studied
Lectures on Reliable Cellular Automata
"... . These notes are selfcontained. Some acquaintance with elementary probability theory and computation theory (Turing machines) is required. The topics are (with the omission of the words \reliable" from each one): Introduction (30 min) Boolean circuits (30 min) Informationstorage circ ..."
Abstract
 Add to MetaCart
storage circuits (60 min) Cellular automata (60 min) Toom's rule and its application (60 min) Hierarchical codes (60 min) Simulation, universality, correcting single errors (60 min) Media and ampliers (60 min) The program and its proof (60 min) Selforganization (60 min) Applications and open
Surjunctivity and reversibility of cellular automata over concrete categories
 In Trends in Harmonic Analysis
"... ar ..."
Cellular automata in noneuclidean spaces
 Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering. Pages 200207. World Scientific and Engineering Academy and Society. 2005
"... Abstract: Classical results on the surjectivity and injectivity of parallel maps are shown to be extendible to the cases with nonEuclidean cell spaces of particular types. Also shown are obstructions to extendibility, which may shed light on the nature of classical results such as the GardenofEde ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ofEden theorem. Key–Words: Cellular automata, Non Euclidean cell spaces, the GardenofEden theorem 1
Large semigroups of cellular automata
, 2011
"... In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to “largeness”. The first property is ID and the other property is maximal commutativity (MC). A semigr ..."
Abstract
 Add to MetaCart
and the other one consists of all the cellular automata transformations which are linear (when the symbols set is the ring of integers mod n). It will be shown that the two properties of these semigroups depend on the number of symbols s. The multiplication semigroup is ID and MC if and only if s is not a power
Results 1  10
of
24,286