Advertisement

Table of contents

  1. Front Matter
  2. Christian Choffrut
    Pages 1-18
  3. Dominique Perrin
    Pages 29-41
  4. E. Goles Ch
    Pages 42-52
  5. Maurice Tchuente
    Pages 53-67
  6. Françoise Fogelman Soulie
    Pages 95-116
  7. Gérard Weisbuch
    Pages 117-125

About these proceedings

Introduction

This volume contains the proceedings of the 14th Spring School of the LITP (Laboratoire d`Informatique Théorique et de Programmation, Université Paris VI-VII, CNRS) held May 12-16, 1986 in Argelès-Village on the French Catalan coast. This meeting was organized by C. Choffrut, M. Nivat, F. Robert, P. Sallé and gathered a hundred participants. The proceedings of the last two Spring Schools have already been published in this series and deal with "Automata on Infinite Words" (LNCS 192) and "Combinators and Functional Programming Languages" (LNCS 242). The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The field chosen this year was the theory of automata networks. Though the content of this book is essentially restricted to computer science aspects of the topic, illustrations were given at the meeting on how the model of cellular automata could be used to solve problems in statistical, fluid and solid state mechanics. Applications to biology with growth models also exist.

Keywords

algorithms automata computer science network programming language theoretical computer science

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-19444-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-19444-6
  • Online ISBN 978-3-540-39270-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site