相关论文: Rescaled entropy of cellular automata

Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…

We created two dimensional hexagonal cellular automata to obtain complexity. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction…

We define the class of rapidly left expansive cellular automata, which contains fractional multiplication automata, Wolfram's Rule 30, and many others. The definition has been shaped by a proposition of Jen on aperiodicity of columns in…

A new class of automata networks is defined. Their evolution rules are determined by a probability measure p on the set of all integers Z and an indicator function I_A on the interval [0,1]. It is shown that any cellular automaton rule can…

We propose a new method to construct an isotropic cellular automaton corresponding to a reaction-diffusion equation. The method consists of replacing the diffusion term and the reaction term of the reaction-diffusion equation with a random…

Autocatalytic chemical reaction networks are dynamical systems whose linearization around zero, dX/dt = AX, is represented by a Perron-Frobenius matrix A with positive Lyapunov exponent; this exponent gives the growth rate of the species…

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…

In this article we study a class of shift-invariant and positive rate probabilistic cellular automata (PCA) on rooted d-regular trees $\mathbb{T}^d$. In a first result we extend the results of [10] on trees, namely we prove that to every…

We study nonhyperbolic and transitive partially hyperbolic diffeomorphisms having a one-dimensional center. We prove joint flexibility with respect to entropy and center Lyapunov exponent for a broad class of these systems. Flexibility…

In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality $p^k$, i.e. the maps $T_{f[l,r]}:\mathbb{Z}^{\mathbb{Z}}_{p^k}\to\mathbb{Z}^{\mathbb{Z}}_{p^k}$ which…

We consider the problem of finding response curves for a class of binary two-dimensional cellular automata with $L$-shaped neighbourhood. We show that the dependence of the density of ones after an arbitrary number of iterations, on the…

We started from computer experiments with simple one-dimensional ergodic dynamical systems called interval exchange transformations. Correlators in these systems decay as a power of time. In the simplest non-trivial case the exponent is…

We determine almost sure limits of rescaled intrinsic volumes of the construction steps of fractal percolation in $\mathbb{R}^d$ for any dimension $d\geq 1$. We observe a factorization of these limit variables which allows, in particular,…

We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…

We show that a behaviour analogous to degenerate hyperbolicity can occur in nearest-neighbour cellular automata (CA) with three states. We construct a 3-state rule by "lifting" elementary CA rule 140. Such "lifted" rule is equivalent to…

We report an imbibition experiment in 2D random porous media in which height - height correlation function grows with a nonuniversal exponent. We find the exponent to depend on evaporation. A cellular automaton model for imbibition based on…

In this work, we study the problem of finding the asymptotic growth rate of the number of of $d$-dimensional arrays with side length $n$ over a given alphabet which avoid a list of one-dimensional "forbidden" words along all cardinal…

In this paper we propose an approach for measuring growth of complexity of emerging patterns in complex systems such as cellular automata. We discuss several ways how a metric for measuring the complexity growth can be defined. This…

Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…

The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on an operation of rescaling is receiving more and more…