31 research outputs found
Number-conserving cellular automaton rules
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 flow diagrams are determined. Various examples are presented and
applications to car traffic are indicated. Two nontrivial three-state
three-input self-conjugate rules have been found. They can be used to model the
dynamics of random walkers.Comment: 4 figure
On the existence of a variational principle for deterministic cellular automaton models of highway traffic flow
It is shown that a variety of deterministic cellular automaton models of
highway traffic flow obey a variational principle which states that, for a
given car density, the average car flow is a non-decreasing function of time.
This result is established for systems whose configurations exhibits local jams
of a given structure. If local jams have a different structure, it is shown
that either the variational principle may still apply to systems evolving
according to some particular rules, or it could apply under a weaker form to
systems whose asymptotic average car flow is a well-defined function of car
density. To establish these results it has been necessary to characterize among
all number-conserving cellular automaton rules which ones may reasonably be
considered as acceptable traffic rules. Various notions such as free-moving
phase, perfect and defective tiles, and local jam play an important role in the
discussion. Many illustrative examples are given.Comment: 19 pages, 4 figure
Randomized Cellular Automata
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 on random directed graphs with constant out-degrees and evolve
according to cellular automaton rules. For some families of rules, a few
typical a priori unexpected results are presented.Comment: 13 pages, 7 figure
Universality and Decidability of Number-Conserving Cellular Automata
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
definition of the property to include cellular automata with any set of states
in \Zset, and show that they can be always extended to ``usual'' NCCA with
contiguous states. We show a way to simulate any one dimensional CA through a
one dimensional NCCA, proving the existence of intrinsically universal NCCA.
Finally, we give an algorithm to decide, given a CA, if its states can be
labeled with integers to produce a NCCA, and to find this relabeling if the
answer is positive.Comment: 13 page
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal
We study two-dimensional rotation-symmetric number-conserving cellular
automata working on the von Neumann neighborhood (RNCA). It is known that such
automata with 4 states or less are trivial, so we investigate the possible
rules with 5 states. We give a full characterization of these automata and show
that they cannot be strongly Turing universal. However, we give example of
constructions that allow to embed some boolean circuit elements in a 5-states
RNCA
Complex dynamics of elementary cellular automata emerging from chaotic rules
We show techniques of analyzing complex dynamics of cellular automata (CA)
with chaotic behaviour. CA are well known computational substrates for studying
emergent collective behaviour, complexity, randomness and interaction between
order and chaotic systems. A number of attempts have been made to classify CA
functions on their space-time dynamics and to predict behaviour of any given
function. Examples include mechanical computation, \lambda{} and Z-parameters,
mean field theory, differential equations and number conserving features. We
aim to classify CA based on their behaviour when they act in a historical mode,
i.e. as CA with memory. We demonstrate that cell-state transition rules
enriched with memory quickly transform a chaotic system converging to a complex
global behaviour from almost any initial condition. Thus just in few steps we
can select chaotic rules without exhaustive computational experiments or
recurring to additional parameters. We provide analysis of well-known chaotic
functions in one-dimensional CA, and decompose dynamics of the automata using
majority memory exploring glider dynamics and reactions
Complex dynamics emerging in Rule 30 with majority memory
In cellular automata with memory, the unchanged maps of the conventional
cellular automata are applied to cells endowed with memory of their past states
in some specified interval. We implement Rule 30 automata with a majority
memory and show that using the memory function we can transform quasi-chaotic
dynamics of classical Rule 30 into domains of travelling structures with
predictable behaviour. We analyse morphological complexity of the automata and
classify dynamics of gliders (particles, self-localizations) in memory-enriched
Rule 30. We provide formal ways of encoding and classifying glider dynamics
using de Bruijn diagrams, soliton reactions and quasi-chemical representations
Probabilistic cellular automata with conserved quantities
We demonstrate that the concept of a conservation law can be naturally
extended from deterministic to probabilistic cellular automata (PCA) rules. The
local function for conservative PCA must satisfy conditions analogous to
conservation conditions for deterministic cellular automata. Conservation
condition for PCA can also be written in the form of a current conservation
law. For deterministic nearest-neighbour CA the current can be computed
exactly. Local structure approximation can partially predict the equilibrium
current for non-deterministic cases. For linear segments of the fundamental
diagram it actually produces exact results.Comment: 17 pages, 2 figure