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 …

SI can be seen also as part of the broader field of computational intelligence (CI)(Keller et al.
2016), which comprises computational methods for problems not solvable by the first …

Research on asynchronous cellular automata has received a great amount of attention
these last years and has turned to a thriving field. We survey the recent research that has …

We present a panorama of the convergence properties of the 256 Elementary Cellular
Automata under fully asynchronous updating, that is, when only one cell is updated at each …

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 …

Reaction systems are discrete dynamical systems inspired by bio-chemical processes,
whose dynamical behaviour is expressed by set-theoretic operations on finite sets. Reaction …

Cellular Automata (CA) are a well-established bio-inspired model of computation that has
been successfully applied in several domains. In the recent years the importance of …

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 …

Interaction testing offers a stable cost-benefit ratio in identifying faults. But in many testing
scenarios, the entire test suite cannot be fully executed due to limited time or cost. In these …

We prove that important properties describing complex behaviours as ergodicity, chaos,
topological transitivity, and topological mixing, are decidable for one-dimensional linear …