Cellular Automata: Simplicity Behind Complexity
by Alejandro Salcido
Publisher: InTech 2011
Number of pages: 566
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.
Home page url
Download or read it online for free here:
by Jorg Flum (ed) - Amsterdam University Press
Mathematical logic and automata theory are two disciplines with a fundamentally close relationship. This book covers many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, etc.
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.
by Jean-Eric Pin
Contents: Algebraic preliminaries; Semigroups and beyond; Languages and automata; Recognizable and rational sets; Green's relations and local theory; Profinite words; Varieties; Equations and languages; Algebraic characterisations; etc.
by Moshe Sipper - Springer
Employing simple parallel cellular models, coupled with evolutionary computation techniques, this volume explores the issue of constructing man-made systems that exhibit characteristics such as those manifest by their natural counterparts.