Additive cellular automata over a finite abelian group are a wide class of cellular automata
(CA) that are able to exhibit most of the complex behaviors of general CA and they are often …

Cellular Automata can be considered discrete dynamical systems and at the same time a
model of parallel computation. In this paper we investigate the connections between …

We continue the study of cellular automata (CA) directional dynamics, ie, the behavior of the
joint action of CA and shift maps. This notion has been investigated for general CA in the …

A cellular automaton is a parallel synchronous computing model, which consists in a
juxtaposition of finite automata whose state evolves according to that of their neighbors. It …

Cellular Automata (CA) are a simple formal model for complex systems. They are used in
many scientific fields (e, g., computer science, physics, mathematics, biology, chemistry …

Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel
computation. The limit set of a cellular automaton is its maximal topological attractor. A well …

Using purely topological concepts, we characterize the class of nondeterministic mappings
between shift spaces that give rise to nondeterministic sliding block codes. We use such …

We introduce the notion of pre-expansivity for cellular automata (CA): it is the property of
being positively expansive on asymptotic pairs of configurations (ie configurations that differ …

Un automate cellulaire est un système dynamique discret qui modélise des objets ayant une
évolution parallèle synchrone: l'espace est divisé en cellules ayant chacune un état et qui …

We prove that in the Game of Life, if the thickness-four zero-padding of a rectangular pattern
is not an orphan, then the corresponding finite-support configuration is not a Garden of …