Cellular automata: analysis and applications / by Karl-Peter Hadeler, Johannes Müller.

Format:

Book

Author/Creator:

Hadeler, Karl-Peter., Author.

Müller, Johannes, Author.

Series:

Springer Monographs in Mathematics, 1439-7382

Language:

English

Subjects (All):

Dynamics.

Ergodic theory.

System theory.

Mathematical physics.

Biomathematics.

Dynamical Systems and Ergodic Theory.

Complex Systems.

Mathematical Applications in the Physical Sciences.

Mathematical and Computational Biology.

Local Subjects:

Dynamical Systems and Ergodic Theory.

Complex Systems.

Mathematical Applications in the Physical Sciences.

Mathematical and Computational Biology.

Physical Description:

1 online resource (XI, 467 p. 78 illus., 3 illus. in color.)

Edition:

1st ed. 2017.

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2017.

Summary:

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.

Contents:

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 Kůrka

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.

Notes:

Includes bibliographical references and index.

ISBN:

3-319-53043-7