Cantitate/Preț
Produs
Update 23 martie - COVID-19 - Informații privind activitatea Books Express

Cellular Automata: Analysis and Applications (Springer Monographs in Mathematics)

De (autor) ,
Notă GoodReads:
en Limba Engleză Hardback – 15 Jun 2017
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 simulate but difficult 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 to cellular automata on Cayley graphs, and their characterization via the fundamental Cutis-Hedlund-Lyndon theorems in the context of various 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 that cellular automata be clustered, similar to the classification of partial differential equations into hyperbolic, parabolic and elliptic equations. This part of the book culminates in the question of whether the properties of cellular automata are decidable. Surjectivity and injectivity are examined, and the seminal Garden of Eden theorems are discussed. In turn, 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 us 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 the Turing pattern, and Greenberg-Hastings automata for excitable media. In addition, models for sand piles, the dynamics of infectious d
Citește tot Restrânge
Toate formatele și edițiile
Toate formatele și edițiile Preț Express
Paperback (1) 43065 lei  Economic 5-7 săpt. +20596 lei  10-18 zile
  Springer – August 2018 43065 lei  Economic 5-7 săpt. +20596 lei  10-18 zile
Hardback (1) 100913 lei  Economic 2-4 săpt. +10625 lei  10-18 zile
  Springer – 15 Jun 2017 100913 lei  Economic 2-4 săpt. +10625 lei  10-18 zile

Din seria Springer Monographs in Mathematics

Preț: 100913 lei

Preț vechi: 110894 lei
-9%

Puncte Express: 1514

Preț estimativ în valută:
19871 22433$ 17947£

Carte disponibilă

Livrare economică 21 iulie-04 august
Livrare express 17-25 iulie pentru 11624 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319530420
ISBN-10: 3319530429
Pagini: 435
Dimensiuni: 155 x 235 mm
Greutate: 0.84 kg
Ediția: 1st ed. 2017
Editura: Springer
Colecția Springer
Seria Springer Monographs in Mathematics

Locul publicării: Cham, Switzerland

Cuprins

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.

Recenzii

“I have enjoyed reading this book. It provides a clear account, with many examples and nice proofs, of the most important and general rigorous results of cellular automata in a way that is accessible to a wide readership. Advanced undergraduate and beginning graduate students of several fields … will find here a valuable toolbox. The book is also valuable for self-study and as a reference, and does a great service in bridging the gap between applications/simulations and rigorous mathematical results.” (Vladimir García Morales, Mathematical Reviews, January, 2018)

“This book gives a comprehensive overview of the methods of analysis that are applicable to these dynamical systems. ... this is the first work that gives a comprehensive overview of the methods that have been proposed to derive a cellular automaton from a partial differential equation, and vice versa. ... this book is a must-have for researchers in the field.” (Jan Baetens, zbMATH 1382.37001, 2018)

Notă biografică

Karl Peter Hadeler, Dr.rer.nat. 1965  (U. of Hamburg), Habilitation 1967 (U. of Hamburg). In 1963/1964 visiting Moscow State University (MGU), 1968/1969 Visiting Associate Professor,U. of Minnesota. 1970 Associate Professor, Technical Department, U. of Erlangen. 1971 Professor of Mathematics, U. of Tübingen. Retired 2005, then 2005-2011 Non-permanent Professor, Arizona State University. Visiting Professor Aarhus, Nijmegen, Georgia Tech, Emory. 2009 John von Neumann Professorship, Technical University of Munich. Member of Center of Excellence (DFG/German NSF). Research interests: Ordinary and partial differential equations (reaction diffusion equations), delay equations, matrix theory, mathematical biology. Since 2011 about ten publications in mathematics. 
Johannes Müller studied in Karlsruhe and Tübingen, where he did his habilitation in 2001. After stays in Utrecht and Cologne, he became head of a research group in the Institute for Biomathematics and Biometry in the Helmholtz Center, Munich. Since 2004 he is teaching as a professor at the Technische Universität München. The research interests of Johannes Müller is on the interface of mathematics and life sciences. In particular his research is concerned with the theory of dynamical systems, cellular automata, and stochastic processes respectively their application.

Textul de pe ultima copertă

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.

Caracteristici

Contains a coherent representation of the main approaches to analyze the dynamics of cellular automata

Emphasizes classification strategies and methods that allow a rigorous analysis and precise understanding of their long term dynamics

Provides basic information to make the book accessible also to physicists, chemists and biologists