Related papers: Phase Transitions of Cellular Automata
The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…
We investigate a simple multisegment cellular automaton model of traffic flow. With the introduction of segment-dependent deceleration probability, metastable congested states in the intermediate density region emerge, and the initial state…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
Defining the density flow of perturbations moving at a given speed for cellular automata, we establish equalities and inequalities between the measurable entropy of a cellular automaton and the measurable entropy of its associated shift.
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…
We consider transformations between attractor basins of binary cylindrical cellular automata resulting from mutations. A t-point mutation of a state consists in toggling t sites in that state. Results of such mutations are described by a…
An exact characterization of the different dynamical behavior that exhibit the space phase of a reversible and conservative cellular automaton, the so called Q2R model, is shown in this paper. Q2R is a cellular automaton which is a…
We propose and investigate a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in…
Three cellular automaton (CA) models of increasing complexity are introduced to model driven diffusive systems related to the generalized Frenkel-Kontorova (FK) models recently proposed by Braun [Phys.Rev.E58, 1311 (1998)]. The models are…
Noise in the local transition function is compared to fluctuations in the updating times of the cells. Obtained results are shown to be quite different in both cases. In this extended abstract we briefly explain the problem and present…
We study the one-dimensional behavior of a cellular automaton aimed at the description of the formation and evolution of cultural domains. The model exhibits a non-equilibrium transition between a phase with all the system sharing the same…
The proposed stochastic model for pedestrian dynamics is based on existing approaches using cellular automata, combined with substantial extensions, to compensate the deficiencies resulting of the discrete grid structure. This agent motion…
The one-dimensional kinetic contact process with parallel update is introduced and studied by Monte Carlo simulations. This process is proposed to describe the plant population replication and epidemic disease spreading among them. The…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
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…
While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular…
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…
We investigate a probabilistic cellular automaton model which has been introduced recently. This model describes single-lane traffic flow on a ring and generalizes the asymmetric exclusion process models. We study the equilibrium properties…
In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the…