© 1999

Cellular Automata

A Parallel Model

  • M. Delorme
  • J. Mazoyer

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

Table of contents

  1. Front Matter
    Pages i-ix
  2. A general survey

    1. Front Matter
      Pages 3-3
    2. M. Delorme
      Pages 5-49
    3. Bruno Durand, Zsuzsanna Róka
      Pages 51-74
  3. Algorithmics

    1. Front Matter
      Pages 75-75
    2. J. Mazoyer
      Pages 77-118
    3. J. Mazoyer
      Pages 119-149
  4. Computational power

    1. Front Matter
      Pages 151-151
    2. M. Delorme, J. Mazoyer
      Pages 153-179
  5. Dynamics

    1. Front Matter
      Pages 211-211
    2. G. Cattaneo, E. Formenti, L. Margara
      Pages 213-259
  6. Modeling

    1. Front Matter
      Pages 261-261
    2. A. L. Bardou, P. M. Auger, R. Seigneuric, J-L Chassé
      Pages 279-290
  7. Particular techniques examples

    1. Front Matter
      Pages 291-291

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.


Automat algorithmics algorithms automata complexity computer computer science modeling number theory

Editors and affiliations

  • M. Delorme
    • 1
  • J. Mazoyer
    • 1
  1. 1.Laboratoire de l’Informatique du ParallélismeENS LyonLyonFrance

Bibliographic information

Industry Sectors
IT & Software
Energy, Utilities & Environment