Advertisement

Table of contents

  1. Front Matter
  2. J-L. Lassez, M. Maher, K. Marriott
    Pages 1-16
  3. Zohar Manna, Amir Pnueli
    Pages 28-42
  4. Mogens Nielsen
    Pages 43-46
  5. Fabio Alessi, Franco Barbanera
    Pages 64-73
  6. Egidio Astesiano, Maura Cerioli
    Pages 74-83
  7. G. Boudol, I. Castellani, M. Hennessy, A. Kiehn
    Pages 93-102
  8. Gerardo Costa, Gianna Reggio
    Pages 103-112
  9. Anton Černý
    Pages 113-120
  10. Pierpaolo Degano, Roberto Gorrieri
    Pages 121-130
  11. Volker Diekert, Paul Gastin, Antoine Petit
    Pages 131-140
  12. Lavinia Egidi, Furio Honsell, Simona Ronchi della Rocca
    Pages 161-169
  13. Roberto Gorrieri, Cosimo Laneve
    Pages 170-180
  14. Georges Hansel, Daniel Krob, Christian Michaux
    Pages 181-190
  15. Barney P. Hilken, David E. Rydeheard
    Pages 191-201
  16. Rodney R. Howell, Petr Jančar, Louis E. Rosier
    Pages 202-210
  17. Petteri Jokinen, Esko Ukkonen
    Pages 240-248
  18. Juhani Karhumaki, Wojciech Rytter, Stefan Jarominek
    Pages 249-258
  19. Dimitris Kavadias, Lefteris M. Kirousis, Paul Spirakis
    Pages 259-266
  20. Delia Kesner
    Pages 267-276
  21. Kounalis Emmanuel, Lugiez Denis, Pottier Loic
    Pages 287-297
  22. Padmanabhan Krishnan
    Pages 298-307
  23. Nguyen Huong Lam, Do Van Long
    Pages 308-317
  24. Hans Leiß, Fritz Henglein
    Pages 318-327
  25. Ugo Montanari, Vladimiro Sassone
    Pages 346-356
  26. Axel Poigné
    Pages 397-405
  27. Y. Roos, P. A. Wacrenier
    Pages 406-414
  28. Back Matter

About these proceedings

Introduction

This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.

Keywords

Automat algorithm algorithms automata complexity computability computability theory distributed computing formal language logic semantics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-54345-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 1991
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-54345-9
  • Online ISBN 978-3-540-47579-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site