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 …
simple local interaction and computation. Since the inception of cellular automaton (CA) by …
[HTML][HTML] Progress, gaps and obstacles in the classification of cellular automata
Classification is one of the most important problems in the theory of CA. For instance,
assessing how CA design choices impact the generated dynamics requires an overview of …
assessing how CA design choices impact the generated dynamics requires an overview of …
On the dynamical behaviour of linear higher-order cellular automata and its decidability
Higher-order cellular automata (HOCA) are a variant of cellular automata (CA) used in many
applications (ranging, for instance, from the design of secret sharing schemes to data …
applications (ranging, for instance, from the design of secret sharing schemes to data …
Complexity of the dynamics of reaction systems
Reaction systems are discrete dynamical systems inspired by bio-chemical processes,
whose dynamical behaviour is expressed by set-theoretic operations on finite sets. Reaction …
whose dynamical behaviour is expressed by set-theoretic operations on finite sets. Reaction …
[HTML][HTML] Multidimensional cellular automata: closing property, quasi-expansivity, and (un) decidability issues
A Dennunzio, E Formenti, M Weiss - Theoretical Computer Science, 2014 - Elsevier
In this paper we study the dynamics of D-dimensional cellular automata (CA) by considering
them as one-dimensional (1D) CA along some direction (slicing constructions). These …
them as one-dimensional (1D) CA along some direction (slicing constructions). These …
A comprehensive taxonomy of cellular automata
Cellular automata (CAs) are fully-discrete dynamical models that have received much
attention due to the fact that their relatively simple setup can nonetheless express highly …
attention due to the fact that their relatively simple setup can nonetheless express highly …
Chaos and ergodicity are decidable for linear cellular automata over (Z/mZ) n
We prove that important properties describing complex behaviours as ergodicity, chaos,
topological transitivity, and topological mixing, are decidable for one-dimensional linear …
topological transitivity, and topological mixing, are decidable for one-dimensional linear …
[HTML][HTML] Dynamical behavior of additive cellular automata over finite abelian groups
We study the dynamical behavior of additive D-dimensional (D≥ 1) cellular automata where
the alphabet is any finite abelian group. This class of discrete time dynamical systems is a …
the alphabet is any finite abelian group. This class of discrete time dynamical systems is a …
m-Asynchronous cellular automata: from fairness to quasi-fairness
A new model for the study of asynchronous cellular automata dynamical behavior is
introduced with the main purpose of unifying several existing paradigms. The main idea is to …
introduced with the main purpose of unifying several existing paradigms. The main idea is to …
Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
Additive cellular automata over a finite abelian group are a wide class of cellular automata
(CA) that are able to exhibit the complex behaviors of general CA and are often exploited for …
(CA) that are able to exhibit the complex behaviors of general CA and are often exploited for …