1,535 research outputs found
A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
Cellular automata (CAs) are dynamical systems which exhibit complex global
behavior from simple local interaction and computation. Since the inception of
cellular automaton (CA) by von Neumann in 1950s, it has attracted the attention
of several researchers over various backgrounds and fields for modelling
different physical, natural as well as real-life phenomena. Classically, CAs
are uniform. However, non-uniformity has also been introduced in update
pattern, lattice structure, neighborhood dependency and local rule. In this
survey, we tour to the various types of CAs introduced till date, the different
characterization tools, the global behaviors of CAs, like universality,
reversibility, dynamics etc. Special attention is given to non-uniformity in
CAs and especially to non-uniform elementary CAs, which have been very useful
in solving several real-life problems.Comment: 43 pages; Under review in Natural Computin
Statistical Mechanics of Surjective Cellular Automata
Reversible cellular automata are seen as microscopic physical models, and
their states of macroscopic equilibrium are described using invariant
probability measures. We establish a connection between the invariance of Gibbs
measures and the conservation of additive quantities in surjective cellular
automata. Namely, we show that the simplex of shift-invariant Gibbs measures
associated to a Hamiltonian is invariant under a surjective cellular automaton
if and only if the cellular automaton conserves the Hamiltonian. A special case
is the (well-known) invariance of the uniform Bernoulli measure under
surjective cellular automata, which corresponds to the conservation of the
trivial Hamiltonian. As an application, we obtain results indicating the lack
of (non-trivial) Gibbs or Markov invariant measures for "sufficiently chaotic"
cellular automata. We discuss the relevance of the randomization property of
algebraic cellular automata to the problem of approach to macroscopic
equilibrium, and pose several open questions.
As an aside, a shift-invariant pre-image of a Gibbs measure under a
pre-injective factor map between shifts of finite type turns out to be always a
Gibbs measure. We provide a sufficient condition under which the image of a
Gibbs measure under a pre-injective factor map is not a Gibbs measure. We point
out a potential application of pre-injective factor maps as a tool in the study
of phase transitions in statistical mechanical models.Comment: 50 pages, 7 figure
Lattice Gas Automata for Reactive Systems
Reactive lattice gas automata provide a microscopic approachto the dynamics
of spatially-distributed reacting systems. After introducing the subject within
the wider framework of lattice gas automata (LGA) as a microscopic approach to
the phenomenology of macroscopic systems, we describe the reactive LGA in terms
of a simple physical picture to show how an automaton can be constructed to
capture the essentials of a reactive molecular dynamics scheme. The statistical
mechanical theory of the automaton is then developed for diffusive transport
and for reactive processes, and a general algorithm is presented for reactive
LGA. The method is illustrated by considering applications to bistable and
excitable media, oscillatory behavior in reactive systems, chemical chaos and
pattern formation triggered by Turing bifurcations. The reactive lattice gas
scheme is contrasted with related cellular automaton methods and the paper
concludes with a discussion of future perspectives.Comment: to appear in PHYSICS REPORTS, 81 revtex pages; uuencoded gziped
postscript file; figures available from [email protected] or
[email protected]
Phase Transitions of Cellular Automata
We explore some aspects of phase transitions in cellular automata. We start
recalling the standard formulation of statistical mechanics of discrete systems
(Ising model), illustrating the Monte Carlo approach as Markov chains and
stochastic processes. We then formulate the cellular automaton problem using
simple models, and illustrate different types of possible phase transitions:
density phase transitions of first and second order, damage spreading, dilution
of deterministic rules, asynchronism-induced transitions, synchronization
phenomena, chaotic phase transitions and the influence of the topology. We
illustrate the improved mean-field techniques and the phenomenological
renormalization group approach.Comment: 13 pages, 14 figure
Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov–Zhabotinsky reaction
Interaction computing (IC) aims to map the properties of integrable low-dimensional non-linear dynamical systems to the discrete domain of finite-state automata in an attempt to reproduce in software the self-organizing and dynamically stable properties of sub-cellular biochemical systems. As the work reported in this paper is still at the early stages of theory development it focuses on the analysis of a particularly simple chemical oscillator, the Belousov-Zhabotinsky (BZ) reaction. After retracing the rationale for IC developed over the past several years from the physical, biological, mathematical, and computer science points of view, the paper presents an elementary discussion of the Krohn-Rhodes decomposition of finite-state automata, including the holonomy decomposition of a simple automaton, and of its interpretation as an abstract positional number system. The method is then applied to the analysis of the algebraic properties of discrete finite-state automata derived from a simplified Petri net model of the BZ reaction. In the simplest possible and symmetrical case the corresponding automaton is, not surprisingly, found to contain exclusively cyclic groups. In a second, asymmetrical case, the decomposition is much more complex and includes five different simple non-abelian groups whose potential relevance arises from their ability to encode functionally complete algebras. The possible computational relevance of these findings is discussed and possible conclusions are drawn
- …