Related papers: Densities and entropies in cellular automata
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
To test a possible relation between the topological entropy and the Arnold complexity, and to provide a non trivial example of a rational dynamical zeta function, we introduce a two-parameter family of two-dimensional discrete rational…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and…
In this paper we study the topological and metric directional entropy of $\mathbb{Z}^2$-actions by generated additive cellular automata (CA hereafter), defined by a local rule $f[l, r]$, $l, r\in \mathbb{Z}$, $l\leq r$, i.e. the maps…
A method is proposed for the characterisation of the entropy of cellular structures, based on the compactivity concept for granular packings. Hamiltonian-like volume functions are constructed both in two and in three dimensions, enabling…
In this paper, we look at two ways to implement determinisitic one dimensional cellular automata into hyperbolic cellular automata in three contexts: the pentagrid, the heptagrid and the dodecagrid, these tilings being classically denoted…
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically…
We discuss a characterization of complexity based on successive approximations of the probability density describing a system by means of maximum entropy methods, thereby quantifying the respective role played by different orders of…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
In this paper we study the measure-theoretical entropy of the one-dimensional linear cellular automata (CA hereafter) $T_{f[-l,r]}$, generated by local rule $f(x_{-l},...,x_{r})= \sum\limits_{i=-l}^{r}\lambda_{i}x_{i}(\text{mod}\ m)$, where…
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on higher dimensional CA and aims at showing that the situation is different…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
Consider the cellular automata (CA) of $\mathbb{Z}^{2}$-action $\Phi$ on the space of all doubly infinite sequences with values in a finite set $\mathbb{Z}_{r}$, $r \geq 2$ determined by cellular automata $T_{F[-k, k]}$ with an additive…
Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
We develop a rather elaborate computer program to investigate the jointly periodic points of one-dimensional cellular automata. The experimental results and mathematical context lead to questions, conjectures and a contextual theorem.