Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented.
Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.
Preface; M. Nivat. Part 1: A general Survey. 1. An Introduction to Cellular Automata; M. Delorme. 2. The Game of Life: Universality Revisited; B. Durand, Zs. Róka. Part 2: Algorithmics. 3. Computations on Cellular Automata; J. Mazoyer. 4. Computation on Grids; J. Mazoyer. Part 3: Computational Power. 5. Cellular Automata as Language Recognizers; M. Delorme, J. Mazoyer. 6. Computational Complexity of Cellular Automata: an Overview; O. Ibarra. 7. A Counting Equivalence Classes Method to Prove Negative Results; V. Terrier. Part 4: Dynamics. 8. Topological Definitions of Deterministic Chaos; G. Cataneo, et al. Part 5: Modeling. 9. Modeling Diffusion of Informations with Probabilistic Cellular Automata; N. Boccara, H. Fuks. 10. Cellular Automata Models and Cardiac Arrhythmias; A. Bardou, et al. Part 6: Particular Techniques Examples. 11. Dynamic Properties of an Automaton with Memory; M. Cosnard. 12. Linear Cellular Automata and De Bruijn Automata; K. Sutner. 13. Cellular Automata, Finite Automata and Number Theory; J.-P. Allouche. 14. Decision Problems on Global Cellular Automata; K. Culik II. 15. An Introduction to Automata on Graphs; E. Rémila. Bibliography. List of Authors. Index.
Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented.
Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.
A general survey.- An Introduction to Cellular Automata.- The Game of Life: Universality Revisited.- Algorithmics.- Computations on Cellular Automata.- Computations on Grids.- Computational power.- Cellular Automata as Languages Recognizers.- Computational Complexity of Cellular Automata: An Overview.- A Counting Equivalence Classes Method to Prove Negative Results.- Dynamics.- Topological Definitions of Deterministic Chaos.- Modeling.- Modeling Diffusion of Innovations with Probabilistic Cellular Automata.- Cellular Automata Models and Cardiac Arrhythmias.- Particular techniques examples.- Dynamic Properties of an Automaton with Memory.- Linear Cellular Automata and de Bruijn Automata.- Cellular Automata, Finite Automata, and Number Theory.- Decision Problems on Global Cellular Automata.- An Introduction to Automata on Graphs.
Inhaltsverzeichnis
Preface; M. Nivat. Part 1: A general Survey. 1. An Introduction to Cellular Automata; M. Delorme. 2. The Game of Life: Universality Revisited; B. Durand, Zs. Róka. Part 2: Algorithmics. 3. Computations on Cellular Automata; J. Mazoyer. 4. Computation on Grids; J. Mazoyer. Part 3: Computational Power. 5. Cellular Automata as Language Recognizers; M. Delorme, J. Mazoyer. 6. Computational Complexity of Cellular Automata: an Overview; O. Ibarra. 7. A Counting Equivalence Classes Method to Prove Negative Results; V. Terrier. Part 4: Dynamics. 8. Topological Definitions of Deterministic Chaos; G. Cataneo, et al. Part 5: Modeling. 9. Modeling Diffusion of Informations with Probabilistic Cellular Automata; N. Boccara, H. Fuks. 10. Cellular Automata Models and Cardiac Arrhythmias; A. Bardou, et al. Part 6: Particular Techniques Examples. 11. Dynamic Properties of an Automaton with Memory; M. Cosnard. 12. Linear Cellular Automata and De Bruijn Automata; K. Sutner. 13. Cellular Automata, Finite Automata and Number Theory; J.-P. Allouche. 14. Decision Problems on Global Cellular Automata; K. Culik II. 15. An Introduction to Automata on Graphs; E. Rémila. Bibliography. List of Authors. Index.
Klappentext
Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented.
Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.
