The volume LNCS 8155 constitutes the refereed proceedings of the 19th International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2013, held in Giessen, Germany, in September 2013. The 8 papers presented were carefully reviewed and selected from 26 submissions. The scope of the workshop spans the following areas the theoretical and practical aspects of a permanent, international, multidisciplinary forum for the collaboration of researchers in the field of Cellular Automata (CA) and Discrete Complex Systems (DCS), to provide a platform for presenting and discussing new ideas and results, to support the development of theory and applications of CA and DCS (e.g. parallel computing, physics, biology, social sciences, and others) as long as fundamental aspects and their relations are concerned, to identify and study within an inter- and multidisciplinary context, the important fundamental aspects, concepts, notions and problems concerning CA and DCS.

This book constitutes the refereed proceedings of the 6th International Conference on Cellular Automata for Research and Industry, ACRI 2004, held in Amsterdam, The Netherlands in October 2004. The 60 revised full papers and 30 poster papers presented were carefully reviewed and selected from 150 submissions. The papers are devoted to methods and theory; evolved cellular automata; traffic, networks, and communication; applications in science and engineering; biomedical applications, natural phenomena and ecology; and social and economical applications.

Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems, i.e., cellular automata and other related discrete complex systems. Thus, arrays of locally connected finite state machines, or cells, update their states simultaneously, in discrete time, by the same transition rule. The classical dynamics in these systems is Markovian: only the actual configuration is taken into account to generate the next one. Generalizing the conventional view on spatially extended discrete dynamical systems evolution by allowing cells (or nodes) to be featured by some trait state computed as a function of its own previous state-values, the transition maps of the classical systems are kept unaltered, so that the effect of memory can be easily traced. The book demonstrates that discrete dynamical systems with memory are not only priceless tools for modeling natural phenomena but unique mathematical and aesthetic objects.

This book constitutes the refereed proceedings of the 7th International Conference on Cellular Automata for Research and Industry, ACRI 2006. The book presents 53 revised full papers and 19 revised poster papers together with 6 invited lectures. Topical sections include CA theory and implementation, computational theory, population dynamics, physical modeling, urban, environmental and social modeling, traffic and boolean networks, multi-agents and robotics, as well as crowds and cellular automata, and more.

In the late 1960s British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells’ states are updated simultaneously and in discrete time. A dead cell comes to life if it has exactly three live neighbours. A live cell remains alive if two or three of its neighbours are alive, otherwise the cell dies. Conway’s Game of Life became the most programmed solitary game and the most known cellular automaton. The book brings together results of forty years of study into computational, mathematical, physical and engineering aspects of The Game of Life cellular automata. Selected topics include phenomenology and statistical behaviour; space-time dynamics on Penrose tilling and hyperbolic spaces; generation of music; algebraic properties; modelling of financial markets; semi-quantum extensions; predicting emergence; dual-graph based analysis; fuzzy, limit behaviour and threshold scaling; evolving cell-state transition rules; localization dynamics in quasi-chemical analogues of GoL; self-organisation towards criticality; asynochrous implementations. The volume is unique because it gives a comprehensive presentation of the theoretical and experimental foundations, cutting-edge computation techniques and mathematical analysis of the fabulously complex, self-organized and emergent phenomena defined by incredibly simple rules.

Cellular automata were introduced in the first half of the last century by John von Neumann who used them as theoretical models for self-reproducing machines. The authors present a self-contained exposition of the theory of cellular automata on groups and explore its deep connections with recent developments in geometric group theory, symbolic dynamics, and other branches of mathematics and theoretical computer science. The topics treated include in particular the Garden of Eden theorem for amenable groups, and the Gromov-Weiss surjunctivity theorem as well as the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. The volume is entirely self-contained, with 10 appendices and more than 300 exercises, and appeals to a large audience including specialists as well as newcomers in the field. It provides a comprehensive account of recent progress in the theory of cellular automata based on the interplay between amenability, geometric and combinatorial group theory, symbolic dynamics and the algebraic theory of group rings which are treated here for the first time in book form.

Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented. Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.

This fascinating, colourful book offers in-depth insights and first-hand working experiences in the production of art works, using simple computational models with rich morphological behaviour, at the edge of mathematics, computer science, physics and biology. It organically combines ground breaking scientific discoveries in the theory of computation and complex systems with artistic representations of the research results. In this appealing book mathematicians, computer scientists, physicists, and engineers brought together marvelous and esoteric patterns generated by cellular automata, which are arrays of simple machines with complex behavior. Configurations produced by cellular automata uncover mechanics of dynamic patterns formation, their propagation and interaction in natural systems: heart pacemaker, bacterial membrane proteins, chemical rectors, water permeation in soil, compressed gas, cell division, population dynamics, reaction-diffusion media and self-organisation. The book inspires artists to take on cellular automata as a tool of creativity and it persuades scientists to convert their research results into the works of art. The book is lavishly illustrated with visually attractive examples, presented in a lively and easily accessible manner.