Cellular automata are simple models of computation which exhibit fascinatingly complex
behavior. They have captured the attention of several generations of researchers, leading to …

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 …

The principle of local activity is precisely the missing concept to explain the emergence of
complex patterns in a homogeneous medium. Leon O. Chua discovered and defined this …

In recent years and decades the development of ever more powerful computer hardware
has been accompanied by the evolution of simulational or computer physics as a third …

We survey the phenomenology of crystal growth and asymptotic shape for two-dimensional,
two-state cellular automata. In the most tractable case ofThreshold Growth, a detailed …

At the beginning of this story is John von Neumann. As far back as 1948 he introduced the
idea of a theory of automata in a conference at the Hixon Symposium, September 1948 (von …

This paper is the first part of a series of two papers dealing with bulking: a quasi-order on
cellular automata comparing space–time diagrams up to some rescaling. Bulking is a …

This reading guide aims to provide the reader with an easy access to the study of
universality in the field of cellular automata. To fulfill this goal, the approach taken here is …

This paper deals with simulation and reversibility in the context of Cellular Automata (ca).
We recall the definitions of ca and of the Block (bca) and Partitioned (pca) subclasses. We …

A grouped instance of a cellular automaton (CA) is another one obtained by grouping
several states into blocks and by letting interact neighbor blocks. Based on this operation a …