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
  15. Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier
    Pages 249-258
  16. Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes
    Pages 259-269
  17. Uschi Heuter
    Pages 270-280
  18. Robert Holte, Louis Rosier, Igor Tulchinsky, Donald Varvel
    Pages 281-290
  19. Sebastian Iwanowski
    Pages 291-304
  20. C. Jousselin, J -P. Moskowitz
    Pages 305-313
  21. Bettina Just
    Pages 314-320
  22. V. Manca, A. Salibra, G. Scollo
    Pages 338-349
  23. Christoph Meinel
    Pages 350-359
  24. J. -J. Ch. Meyer, E. P. de Vink
    Pages 360-369
  25. David A. Mix Barrington, Pierre McKenzie
    Pages 370-379
  26. Vladimír Palko, Ondrej Sýkora, Imrich Vrťo
    Pages 390-396
  27. Pierre Péladeau
    Pages 397-407
  28. Mireille Regnier
    Pages 431-444
  29. Erik M. Schmidt, Michael I. Schwartzbach
    Pages 458-470
  30. Maciej Slusarek
    Pages 471-480

About these proceedings


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.


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

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 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
  • Buy this book on publisher's site