Table of contents

  1. Front Matter
  2. Ludmila A. Cherkasova
    Pages 27-43
  3. Maxime Crochemore
    Pages 44-58
  4. Uwe Schöning
    Pages 93-106
  5. Martin Wirsing, Rolf Hennicker, Ruth Breu
    Pages 121-137
  6. Burkhard Monien, Hal Sudborough
    Pages 138-153
  7. E. Allevi, A. Cherubini, S. Crespi Reghizzi
    Pages 162-170
  8. Frank Bauernöppel, Hermann Jung
    Pages 171-179
  9. J. Beauquier, A. Petit
    Pages 180-189
  10. Francis Bossut, Max Dauchet, Bruno Warin
    Pages 190-200
  11. Véronique Bruyere
    Pages 201-209
  12. Heino Carstensen
    Pages 210-219
  13. Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
    Pages 220-230

About these proceedings

Introduction

This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.

Keywords

algorithm algorithms complexity complexity theory computer computer science database formal language programming semantics

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0017126
  • Copyright Information Springer-Verlag 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-50110-7
  • Online ISBN 978-3-540-45926-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Biotechnology