Related papers: Probabilistic cellular automata with memory two: i…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
A family of reversible deterministic cellular automata, including the rules 54 and 201 of [Bobenko et al., Commun. Math. Phys. 158, 127 (1993)] as well as their kinetically constrained quantum (unitary) or stochastic deformations, is shown…
We introduce a class of discrete random walk model driven by global memory effects. At any time the right-left transitions depend on the whole previous history of the walker, being defined by an urn-like memory mechanism. The characteristic…
A novel two-state, Reversible Cellular Automata (RCA) is described. This three-dimensional RCA is shown to be capable of universal computation. Additionally, evidence is offered that this RCA Is capable of universal construction.
Deterministic and time-reversible nonequilibrium molecular dynamics simulations typically generate "fractal" [ fractional-dimensional ] phase-space distributions. Because these distributions and their time-reversed twins have zero phase…
We study a stochastic multiplicative process with reset events. It is shown that the model develops a stationary power-law probability distribution for the relevant variable, whose exponent depends on the model parameters. Two qualitatively…
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)…
Probabilistic cellular automata are prototypes of non equilibrium critical phenomena. This class of models includes among others the directed percolation problem (Domany Kinzel model) and the dynamical Ising model. The critical properties…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
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…
The dynamics of rule 54 one-dimensional two-state cellular automaton (CA) are a discrete analog of a space-time dynamics of excitations in nonlinear active medium with mutual inhibition. A cell switches its state 0 to state 1 if one of its…
A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their…
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…
We study the relaxation of a Brownian particle with long range memory under confinement in one dimension. The particle diffuses in an arbitrary confining potential and resets at random times to previously visited positions, chosen with a…
Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself, in state `1'. In Boolean terms the cell-state transition…
Images encode both the state of the world and its content. The former is useful for tasks such as planning and control, and the latter for classification. The automatic extraction of this information is challenging because of the…
We show that the probability distribution function that best fits the distribution of return times between two consecutive visits of a chaotic trajectory to finite size regions in phase space deviates from the exponential statistics by a…
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
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…