Related papers: The cellular automaton pulsing model, experiments …
We show how to construct a deterministic nearest-neighbour cellular automaton (CA) with four states which emulates diffusion on a one-dimensional lattice. The pseudo-random numbers needed for directing random walkers in the diffusion…
The synchronization of two stochastically coupled one-dimensional cellular automata (CA) is analyzed. It is shown that the transition to synchronization is characterized by a dramatic increase of the statistical complexity of the patterns…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
Many diffusion processes in nature and society were found to be anomalous, in the sense of being fundamentally different from conventional Brownian motion. An important example is the migration of biological cells, which exhibits…
This paper presents a new framework for asynchrony. This has its origins in our attempts to better harness the internal decision making process of cellular automata (CA). Thus, we show that a max-plus algebraic model of asynchrony arises…
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed…
We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…
We have determined families of two-dimensional deterministic totalistic cellular automaton rules whose stationary density of active sites exhibits a period two in time. Each family of deterministic rules is characterized by an ``average…
We study a cellular automaton model, which allows diffusion of energy (or equivalently any other physical quantities such as mass of a particular compound) at every lattice site after each timestep. Unit amount of energy is randomly added…
We investigate one-dimensional Probabilistic Cellular Automata, called Diploid Elementary Cellular Automata (DECA), obtained as random mixture of two different Elementary Cellular Automata rules. All the cells are updated synchronously and…
In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…
We analyze the collective behavior of a lattice model of pulse-coupled oscillators. By means of computer simulations we find the relation between the intrinsic dynamics of each member of the population and their mutual interaction that…
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…
We study the emergence of information integration in cellular automata (CA) with respect to states in the long run. Information integration is in this case quantified by applying the information-theoretic measure known as total correlation…
We investigate numerically the behaviour of damage spreading in a Kauffman cellular automaton with quenched rules on a dynamical $\phi^3$ graph, which is equivalent to coupling the model to discretized 2D gravity. The model is interesting…
A general stochastic traffic cellular automaton (CA) model, which includes slow-to-start effect and driver's perspective, is proposed in this paper. It is shown that this model includes well known traffic CA models such as…