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
Automata and Rational Expressions
by Jacques Sakarovitch - arXiv.org
From the table of contents: A new look at Kleene's theorem; Rationality and recognisability (Rational expressions); From automata to expressions; From expressions to automata; Changing the monoid; Introducing weights; Notes; References.
(5108 views)
by Jacques Sakarovitch - arXiv.org
From the table of contents: A new look at Kleene's theorem; Rationality and recognisability (Rational expressions); From automata to expressions; From expressions to automata; Changing the monoid; Introducing weights; Notes; References.
(5108 views)
Tree Automata Techniques and Applications
by H. Comon, M. Dauchet, R. Gilleron
This textbook presents the basics of tree automata, focusing on the operational aspects. It should appeal the reader who wants a simple presentation of the basics, and to see how some variations of tree automata provide a tool for difficult problems.
(14419 views)
by H. Comon, M. Dauchet, R. Gilleron
This textbook presents the basics of tree automata, focusing on the operational aspects. It should appeal the reader who wants a simple presentation of the basics, and to see how some variations of tree automata provide a tool for difficult problems.
(14419 views)
Cellular Automata
- 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...
(7013 views)
- 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...
(7013 views)
Notes on Automata, Logics, Games and Algebra
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.
(8645 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.
(8645 views)