Table of contents

  1. Front Matter
  2. Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
    Pages 8-17
  3. Bernd Becker, Reiner Kolla
    Pages 18-28
  4. Bettina Just, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, Avi Wigderson
    Pages 29-37
  5. Mark H. Overmars, Michiel H. M. Smid
    Pages 38-51
  6. David Fernández-Baca, Giora Slutzki
    Pages 52-60
  7. Walter Unger
    Pages 61-72
  8. François Bergeron, Gilbert Labelle, Pierre Leroux
    Pages 73-80
  9. Volker Diekert, Axel Möbus
    Pages 126-135
  10. Clelia De Felice
    Pages 159-169
  11. Jean-Paul Allouche, Bernard Rande, Loÿs Thimonier
    Pages 170-183

About these proceedings

Introduction

This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 11-13, 1988. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism.

Keywords

Algorithms Automat Bisimulation Boolean algebra Modula Monoid Scheduling automata complexity computer computer algebra data structure formal language programming semantics

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0035825
  • Copyright Information Springer-Verlag 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-18834-6
  • Online ISBN 978-3-540-48190-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349