相关论文: Probabilistic cellular automata with conserved qua…
The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata,…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
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…
Probabilistic Cellular Automata are extended stochastic systems, widely used for modelling phenomena in many disciplines. The possibility of controlling their behaviour is therefore an important topic. We shall present here an approach to…
We compare several definitions for number-conserving cellular automata that we prove to be equivalent. A necessary and sufficient condition for \cas to be number-conserving is proved. Using this condition, we give a linear-time algorithm to…
Cellular Automata(CA) is a discrete computing model which provides simple, flexible and efficient platform for simulating complicated systems and performing complex computation based on the neighborhoods information. CA consists of two…
If X is a discrete abelian group and B a finite set, then a cellular automaton (CA) is a continuous map F:B^X-->B^X that commutes with all X-shifts. If g is a real-valued function on B, then, for any b in B^X, we define G(b) to be the sum…
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…
We study one dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram's classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the…
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 focus on a family of one-dimensional probabilistic cellular automata with memory two: the dynamics is such that the value of a given cell at time $t+1$ is drawn according to a distribution which is a function of the states of its two…
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…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced…
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…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…