Cellular Automata: Simplicity Behind Complexity
by Alejandro Salcido
Publisher: InTech 2011
ISBN-13: 9789533072302
Number of pages: 566
Description:
Cellular automata make up a class of completely discrete dynamical systems, which have became a core subject in the sciences of complexity due to their conceptual simplicity, easiness of implementation for computer simulation, and their ability to exhibit a wide variety of amazingly complex behavior.
Download or read it online for free here:
Download link
(31MB, PDF)
Similar books

- Wikibooks
This book aims to become a graduate to postgraduate level schoolbook on cellular automata. The book is divided into two parts, covering formalization, well known algorithms, accepted elegant proofs, FAQ, examples, web resources, etc...
(8434 views)

by K Narayan Kumar - Chennai Mathematical Institute
Contents: Regular Languages and Monoids; Languages via Logical Formulae; MSO to Regular Languages; EF Games and First-order Definability; Schutzenberger's Theorem; Alternating Automata; Buchi Automata; Buchi Games over Infinite Graphs; etc.
(9813 views)

by Javier Esparza
These notes introduce the theory of finite- and omega-automata from an algorithmic point of view. They present automata as a data structure for sets that allows for efficient implementations of the basic set-theoretical operations.
(1672 views)

by B. Aoun, M. Tarifi - arXiv
In this text the authors attempt to provide a useful introduction to quantum cellular automata from a computing perspective. For clarity and accessibility they provide a brief overview of both quantum computing and classical cellular automata.
(10764 views)