Cellular Automata: A Parallel Model

Author:   M. Delorme ,  J. Mazoyer
Publisher:   Springer
Edition:   Softcover reprint of hardcover 1st ed. 1999
Volume:   460
ISBN:  

9789048151431


Pages:   374
Publication Date:   09 December 2010
Format:   Paperback
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Our Price $564.96 Quantity:  
Add to Cart

Share |

Cellular Automata: A Parallel Model


Add your own review!

Overview

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.

Full Product Details

Author:   M. Delorme ,  J. Mazoyer
Publisher:   Springer
Imprint:   Springer
Edition:   Softcover reprint of hardcover 1st ed. 1999
Volume:   460
Dimensions:   Width: 15.50cm , Height: 2.00cm , Length: 23.50cm
Weight:   0.587kg
ISBN:  

9789048151431


ISBN 10:   9048151430
Pages:   374
Publication Date:   09 December 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List