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 …

We analyze the properties of a synchronous and of various asynchronous methods to iterate
cellular automata. Asynchronous methods in which the time variable is not explicitly defined …

Computing in Nonlinear Media and Automata Collectives presents an account of new ways
to design massively parallel computing devices in advanced mathematical models, such as …

Parallelism and concurrency are fundamental concepts in computer science. Specification
and verification of concurrent programs are of first importance. It concerns our daily life …

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 …

This paper reviews the basic properties of the equational and recognizable subsets of
general algebras; these sets can be seen as generalizations of the context-free and regular …

The study of computational problems in combinatorial group theory goes back more than
100 years. In a seminal paper from 1911, Max Dehn posed three decision problems [46]: the …

We prove that every monadic second-order property of the unfolding of a transition system is
a monadic second-order property of the system itself. An unfolding is an instance of the …

Graphs are finite and handled as relational structures. We give some answers to the
following general questions: Applications concern dependency graphs of partially …

Classically, in cellular automata, no delay in information sharing among the neighbouring
cells is considered. However, this assumption is not generally true for natural complex …