Table of contents

  1. Front Matter
  2. Bin Cong, Zevi Miller, I. H. Sudborough
    Pages 29-46
  3. Juraj Wiedermann
    Pages 93-108
  4. M. Anselmo
    Pages 109-119
  5. J. L. Coquidé, R. Gilleron
    Pages 120-129
  6. Carsten Damm
    Pages 130-137
  7. Andreas Goerdt, Helmut Seidl
    Pages 148-158
  8. M. Loebl
    Pages 169-176
  9. Martin F. Møller
    Pages 184-194
  10. Maryse Pelletier
    Pages 195-203
  11. Klaus Reinhardt
    Pages 214-224

About these proceedings

Introduction

This volume contains the texts of the tutorial lecture, five invited lectures and twenty short communications contributed for presentation at the Sixth International Meeting of Young Computer Scientists, IMYCS '90. The aim of these meetings is threefold: (1) to inform on newest trends, results, and problems in theoretical computer science and related fields through a tutorial and invited lectures delivered by internationally distinguished speakers, (2) to provide a possibility for beginners in scientific work to present and discuss their results, and (3) to create an adequate opportunity for establishing first professional relations among the participants.

Keywords

Computer Monoid algorithms automata complexity computer science petri net theorem proving theoretical computer science

Bibliographic information

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