Table of contents

  1. Front Matter
  2. David Harel
    Pages 35-48
  3. Ludmila A. Cherkasova, Vadim E. Kotov
    Pages 67-87
  4. Kurt Mehlhorn, Stefan Näher
    Pages 88-106
  5. Ernst-Rüdiger Olderog
    Pages 107-132
  6. B. A. Trakhtenbrot
    Pages 133-134
  7. Hajnal Andréka, István Németi, Ildikó Sain
    Pages 135-144
  8. Eric Badouel
    Pages 155-164
  9. Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten
    Pages 165-176
  10. Bogdan Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha
    Pages 185-195
  11. Jűrgen Dassow, Juraj Hromkovič, Juhani Karhumaki, Branislav Rovan, Anna Slobodová
    Pages 196-206
  12. Krzysztof Diks, Torben Hagerup, Wojciech Rytter
    Pages 207-217
  13. Jordi Farrés-Casals
    Pages 225-235
  14. Rob van Glabbeek, Ursula Goltz
    Pages 237-248

About these proceedings

Introduction

The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.

Keywords

algorithms automata complexity computability computability theory databases formal language theoretical computer science

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-51486-4
  • Copyright Information Springer-Verlag 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-51486-2
  • Online ISBN 978-3-540-48176-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book