Automata 2008

Cellular automata are regular uniform networks of locally-connected finite-state machines. They are discrete systems with non-trivial behaviour. Cellular automata are ubiquitous: they are mathematical models of computation and computer models of natural systems. The book presents results of cutting edge research in cellular-automata framework of digital physics and modelling of spatially extended non-linear systems; massive-parallel computing, language acceptance, and computability; reversibility of computation, graph-theoretic analysis and logic; chaos and undecidability; evolution, learning and cryptography. The book is unique because it brings together unequalled expertise of inter-disciplinary studies at the edge of mathematics, computer science, engineering, physics and biology.

Reaction-diffusion and excitable media are amongst most intriguing substrates. Despite apparent simplicity of the physical processes involved the media exhibit a wide range of amazing patterns: from target and spiral waves to travelling localisations and stationary breathing patterns. These media are at the heart of most natural processes, including morphogenesis of living beings, geological formations, nervous and muscular activity, and socio-economic developments. This book explores a minimalist paradigm of studying reaction-diffusion and excitable media using locally-connected networks of finite-state machines: cellular automata and automata on proximity graphs. Cellular automata are marvellous objects per se because they show us how to generate and manage complexity using very simple rules of dynamical transitions. When combined with the reaction-diffusion paradigm the cellular automata become an essential user-friendly tool for modelling natural systems and designing future and emergent computing architectures. The book brings together hot topics of non-linear sciences, complexity, and future and emergent computing. It shows how to discover propagating localisation and perform computation with them in very simple two-dimensional automaton models. Paradigms, models and implementations presented in the book strengthen the theoretical foundations in the area for future and emergent computing and lay key stones towards physical embodied information processing systems.

This book constitutes the refereed proceedings of the 9th International Conference on Cellular Automata for Research and Industry, ACRI 2010, held in Ascoli Piceno, Italy, in September 2010. The first part of the volume contains 39 revised papers that were carefully reviewed and selected from the main conference; they are organized according to six main topics: theoretical results on cellular automata, modeling and simulation with cellular automata, CA dynamics, control and synchronization, codes and cryptography with cellular automata, cellular automata and networks, as well as CA-based hardware. The second part of the volume comprises 35 revised papers dedicated to contributions presented during ACRI 2010 workshops on theoretical advances, specifically asynchronous cellular automata, and challenging application contexts for cellular automata: crowds and CA, traffic and CA, and the international workshop of natural computing.

ICALP 2008, the 35th edition of the International Colloquium on Automata, Languages and Programming, was held in Reykjavik, Iceland, July 7–11, 2008. ICALP is a series of annual conferences of the European Association for Th- reticalComputer Science(EATCS) which ?rsttook placein 1972.This year,the ICALP program consisted of the established Track A (focusing on algorithms, automata,complexityandgames)andTrackB(focusing onlogic,semanticsand theory of programming), and of the recently introduced Track C (focusing on security and cryptography foundations). In response to the call for papers, the Program Committees received 477 submissions, the highest ever: 269 for Track A, 122 for TrackB and 86 for Track C. Out of these, 126 papers were selected for inclusion in the scienti?c program: 70 papers for Track A, 32 for Track B and 24 for Track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many deserving papers could not be selected. ICALP 2008 consisted of ?ve invited lectures and the contributed papers.

This book constitutes the proceedings of the 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, held in Fez, Morocco, in September 2014. The 45 full papers and 4 invited talks presented in this volume were carefully reviewed and selected from 59 submissions. This volume contains invited contributions and accepted papers from the main track and from the three organized workshops. The first part is organized according to three topics: (1) Cellular Automata Theory and Implementation (2) Cellular Automata Dynamics and Synchronization, (3) Asynchronous Cellular Automata and Asynchronous Discrete Models - ACA. The second part of the volume contains three topics: (4) Modelling and Sim-ulation with Cellular Automata (5) Crowds, Traffic and Cellular Automata –CT&CA (6) Agent-Based Simulation and Cellular Automata – ABS&CA.

This book gathers selected research papers presented at the First Asian Symposium on Cellular Automata Technology (ASCAT 2022), organized online by academicians from Kolkata, India, during March 3–5, 2022. The book presents one of the most emergent areas in natural computing, cellular automaton (CA). CA is a paradigm of uniform fine-grained parallel computation which has been explored to understand complex systems by developing its model at the microscopic level. The book discusses many real-life problems in the domain of very large-scale integration (VLSI) design and test, pattern recognition and classification, cryptography, pseudo-random pattern generation, image processing, sensor networks, material science, etc., by using CA.

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.

This book gathers selected research papers presented at the Second Asian Symposium on Cellular Automata Technology (ASCAT 2023), organized by academicians from Kolkata at Indian Institute of Engineering Science and Technology, Shibpur, West Bengal, India, and by researchers of Cellular Automata India, a research group which was created during the pandemic, during March 2–4, 2023. The book presents one of the most emergent areas in natural computing, cellular automaton (CA). CA is a paradigm of uniform fine-grained parallel computation which has been explored to understand complex systems by developing its model at the microscopic level. The book discusses many real-life problems in the domain of pattern recognition and classification, clustering, electronic circuit design, bioinformatics, material and mining engineering, modelling of physical and social systems, etc., by using CA.