Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Cellular Automata: Analysis and Applications

Cellular Automata: Analysis and Applications
Catalogue Information
Field name Details
Dewey Class 515.39
515.48
Title Cellular Automata: Analysis and Applications ([EBook]) / by Karl-Peter Hadeler, Johannes M?ller.
Author Hadeler, Karl Peter
Added Personal Name M?ller, Johannes author.
Other name(s) SpringerLink (Online service)
Publication Cham : : Springer International Publishing : : Imprint: Springer, , 2017.
Physical Details XI, 467 p. 78 illus., 3 illus. in color. : online resource.
Series Springer monographs in mathematics 1439-7382
ISBN 9783319530437
Summary Note 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 (Kurka 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.:
Contents note 1.Introduction -- 2.Cellular automata - basic definitions -- 3.Cantor topology of cellular automata -- 4.Besicovitch and Weyl topologies -- 5 Attractors -- 6 Chaos and Lyapunov stability -- 7 Language classification of Kurka -- 8.Turing machines, tiles, and computability -- 9 Surjectivity and injectivity of global maps -- 10.Linear Cellular Automata -- 11 Particle motion -- 12 -- Pattern formation -- 13.Applications in various areas -- A.Basic mathematical tools.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-3-319-53043-7
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 38114 Beginning of record . Catalogue Information 38114 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating38114
. E-mail This Page
Quick Search