<p>This book provides an overview of the main approaches used to analyze the dynamics of cellular automata. Cellular automata are an indispensable tool in mathematical modeling. In contrast to classical modeling approaches like partial differential equations, cellular automata are relatively easy to
Cellular Automata: Analysis and Applications
β Scribed by Karl-Peter Hadeler, Johannes MΓΌller (auth.)
- Publisher
- Springer International Publishing
- Year
- 2017
- Tongue
- English
- Leaves
- 467
- Series
- Springer Monographs in Mathematics
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cellular automata. Cellular automata are an inevitable tool in mathematical modeling. In contrast to classical modeling approaches as partial differential equations, cellular automata are straightforward to simulate but hard to analyze. In this book we present a review of approaches and theories that allow the reader to understand the behavior of cellular automata beyond simulations.
The first part consists of an introduction of cellular automata on Cayley graphs, and their characterization via the fundamental Cutis-Hedlund-Lyndon theorems in the context of different topological concepts (Cantor, Besicovitch and Weyl topology). The second part focuses on classification results: What classification follows from topological concepts (Hurley classification), Lyapunov stability (Gilman classification), and the theory of formal languages and grammars (KΕ―rka classification). These classifications suggest to cluster cellular automata, similar to the classification of partial differential equations in hyperbolic, parabolic and elliptic equations. This part of the book culminates in the question, whether properties of cellular automata are decidable. Surjectivity, and injectivity are examined, and the seminal Garden of Eden theorems are discussed.
The third part focuses on the analysis of cellular automata that inherit distinct properties, often based on mathematical modeling of biological, physical or chemical systems. Linearity is a concept that allows to define self-similar limit sets. Models for particle motion show how to bridge the gap between cellular automata and partial differential equations (HPP model and ultradiscrete limit). Pattern formation is related to linear cellular automata, to the Bar-Yam model for Turing pattern, and Greenberg-Hastings automata for excitable media. Also models for sandpiles, the dynamics of infectious diseases and evolution of predator-prey systems are discussed. Mathematicians find an overview about theory and tools for the analysis of cellular automata. The book contains an appendix introducing basic mathematical techniques and notations, such that also physicists, chemists and biologists interested in cellular automata beyond pure simulations will benefit.
β¦ Table of Contents
Front Matter....Pages i-xi
Introduction....Pages 1-17
Cellular Automata: Basic Definitions....Pages 19-35
Cantor Topology of Cellular Automata....Pages 37-73
Besicovitch and Weyl Topologies....Pages 75-109
Attractors....Pages 111-153
Chaos and Lyapunov Stability....Pages 155-177
Language Classification of KΕ―rka....Pages 179-195
Turing Machines, Tiles, and Computability....Pages 197-252
Surjectivity and Injectivity of Global Maps....Pages 253-285
Linear Cellular Automata....Pages 287-334
Particle Motion....Pages 335-375
Pattern Formation....Pages 377-403
Applications in Various Areas....Pages 405-425
Back Matter....Pages 427-467
β¦ Subjects
Dynamical Systems and Ergodic Theory;Complex Systems;Mathematical Applications in the Physical Sciences;Mathematical and Computational Biology
π SIMILAR VOLUMES
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 cutt
<p>It is with great pleasure that I present this fourth volΒ ume in the series "Advanced Applications in Pattern Recognition." It would be difficult to find two authors better versed in the design and application of parallel image processing systems, due to both their own many years of pioneering in
<p>This book highlights both theoretical and applied advances in cellular learning automata (CLA), a type of hybrid computational model that has been successfully employed in various areas to solve complex problems and to model, learn, or simulate complicated patterns of behavior. Owing to CLAβs par
<p><P>This book focuses on a challenging application field of cellular automata: pattern formation in biological systems, such as the growth of microorganisms, dynamics of cellular tissue and tumors, and formation of pigment cell patterns. These phenomena, resulting from complex cellular interaction