Skip to main content
SpringerLink
Log in

Cellular Automata

A Parallel Model

  • Book
  • © 1999

Overview

Editors:
  1. M. Delorme

    1. Laboratoire de l’Informatique du Parallélisme, ENS Lyon, Lyon, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. J. Mazoyer

    1. Laboratoire de l’Informatique du Parallélisme, ENS Lyon, Lyon, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Mathematics and Its Applications (MAIA, volume 460)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 chapters)

  1. Front Matter

    Pages i-ix
    Download chapter PDF

  2. A general survey

    1. Front Matter

      Pages 3-3
      Download chapter PDF

    2. An Introduction to Cellular Automata

      • M. Delorme
      Pages 5-49

    3. The Game of Life: Universality Revisited

      • Bruno Durand, Zsuzsanna Róka
      Pages 51-74

  3. Algorithmics

    1. Front Matter

      Pages 75-75
      Download chapter PDF

    2. Computations on Cellular Automata

      • J. Mazoyer
      Pages 77-118

    3. Computations on Grids

      • J. Mazoyer
      Pages 119-149

  4. Computational power

    1. Front Matter

      Pages 151-151
      Download chapter PDF

    2. Cellular Automata as Languages Recognizers

      • M. Delorme, J. Mazoyer
      Pages 153-179

    3. Computational Complexity of Cellular Automata: An Overview

      • O. Ibarra
      Pages 181-197

    4. A Counting Equivalence Classes Method to Prove Negative Results

      • V. Terrier
      Pages 199-210

  5. Dynamics

    1. Front Matter

      Pages 211-211
      Download chapter PDF

    2. Topological Definitions of Deterministic Chaos

      • G. Cattaneo, E. Formenti, L. Margara
      Pages 213-259

  6. Modeling

    1. Front Matter

      Pages 261-261
      Download chapter PDF

    2. Modeling Diffusion of Innovations with Probabilistic Cellular Automata

      • N. Boccara, H. Fukś
      Pages 263-277

    3. Cellular Automata Models and Cardiac Arrhythmias

      • A. L. Bardou, P. M. Auger, R. Seigneuric, J-L Chassé
      Pages 279-290

  7. Particular techniques examples

    1. Front Matter

      Pages 291-291
      Download chapter PDF

    2. Dynamic Properties of an Automaton with Memory

      • M. Cosnard
      Pages 293-302

    3. Linear Cellular Automata and de Bruijn Automata

      • K. Sutner
      Pages 303-319

    4. Cellular Automata, Finite Automata, and Number Theory

      • J.-P. Allouche
      Pages 321-330
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Laboratoire de l’Informatique du Parallélisme, ENS Lyon, Lyon, France

    M. Delorme, J. Mazoyer

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation