Related papers: Simulations between triangular and hexagonal numbe…
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…
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dimensional number-conserving cellular automata with one kind of…
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…
We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…
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…
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…
This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the…
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…
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…
This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow…
This paper concerns $d$-dimensional cellular automata with the von Neumann neighborhood that conserve the sum of the states of all their cells. These automata, called number-conserving or density-conserving cellular automata, are of…
We show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show…
We present necessary and sufficient conditions for a cellular automaton with a von Neumann neighborhood of range one to be number-conserving. The conditions are formulated for any dimension and for any set of states containing zero. The use…
A one-dimensional two-state number-conserving cellular automaton (NCCA) is a cellular automaton whose states are 0 or 1 and where cells take states 0 and 1 and updated their states by the rule which keeps overall sum of states constant. It…
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 Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an…
We introduce a novel framework of reservoir computing. Cellular automaton is used as the reservoir of dynamical systems. Input is randomly projected onto the initial conditions of automaton cells and nonlinear computation is performed on…
We introduce a novel framework of reservoir computing, that is capable of both connectionist machine intelligence and symbolic computation. Cellular automaton is used as the reservoir of dynamical systems. Input is randomly projected onto…
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…
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,…