Related papers: Number-conserving cellular automaton rules
The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a…
The searching for the stable patterns in the evolution of cellular automata is implemented using stochastic synchronization between the present structures of the system and its precedent configurations. For most of the known evolution rules…
Computing the configuration of any one-dimensional cellular automaton at generation $n$ can be accelerated by constructing and running a composite rule with a radius proportional to $\log n$. The new automaton is the original one, but with…
The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a…
We propose and discuss two variants of kinetic particle models - cellular automata in 1+1 dimensions, which have some appeal due to their simplicity and intriguing properties which could warrant further research and applications. The first…
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…
In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…
The cellular automata with local permutation invariance are considered. We show that in the two-state case the set of such automata coincides with the generalized Game of Life family. We count the number of equivalence classes of the rules…
We present evidence that operation of QCA (Quantum Cellular Automaton) cells with four dots is possible with an occupancy of 4N+2 electrons per cell (N being an integer). We show that interaction between cells can be described in terms of a…
A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations).…
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
In this paper, we prove that there is a weakly universal cellular automaton on the pentagrid with three states which is rotation invariant and which uses \`a la Moore neighbourhood. Moreover, at each step of the computation, the set of non…
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial…
Recently Prosen and Mej\'ia-Monasterio (J. Phys. A: Math. Theor. 49 (2016) 185003) obtained exact nonequilibrium steady states of an integrable and reversible cellular automaton driven by some stochastic boundary conditions. In this paper,…
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…
The rule 184 fuzzy cellular automaton is regarded as a mathematical model of traffic flow because it contains the two fundamental traffic flow models, the rule 184 cellular automaton and the Burgers equation, as special cases. We show that…
A small-world cellular automaton network has been formulated to simulate the long-range interactions of complex networks using unconventional computing methods in this paper. Conventional cellular automata use local updating rules. The new…