We provide an efficient algorithm deciding chaos for linear cellular automata (LCA) over
(Z/m Z) n, a large and important class of cellular automata (CA) which may exhibit many of …

The property of reversibility is quite meaningful for the classic theoreticabl computer science
model, cellular automata. This paper focuses on the reversibility of general one-dimensional …

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 …

The one-dimensional cellular automata (CA) system detailed herein uses a hybrid
mechanism to attain reversibility, and this approach is adapted to create a novel block cipher …

During the last few decades, significant efforts have been devoted to analyze the dynamical
behavior of cellular automata (CAs) on cyclic groups, their Cartesian power (referred to as …

We provide an efficiently computable characterization of two important properties describing
stable and unstable complex behaviours as equicontinuity and sensitivity to the initial …

This paper proposes a study of deterministic P systems with active membranes in the context
of discrete time dynamical systems. First of all, we prove that, for a fixed set of objects and …

Theory of Cellular Automata: from the Past and Present to Some Path Towards the Future |
SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal …

We focus on how the dynamical properties of any Linear CA over (Z/m Z) n are hidden inside
the characteristic polynomial of its defining matrix, namely, a polynomial of degree n in the …

We prove that positive expansivity is a decidable property for Additive Cellular Automata
over a finite abelian group. First of all, the decidability result is provided for the non trivial …