Table of contents

  1. Front Matter
  2. E. Allen Emerson, Chin-Laung Lei
    Pages 21-36
  3. M. A. Nait Abdallah
    Pages 60-72
  4. E. H. L. Aarts, F. M. J. de Bont, J. H. A. Habers, P. J. M. van Laarhoven
    Pages 87-97
  5. J. Hastad, B. Helfrich, J. Lagarias, C. P. Schnorr
    Pages 105-118
  6. H. L. Bodlaender, J. van Leeuwen
    Pages 119-129
  7. Roberto Tamassia, Ioannis G. Tollis
    Pages 130-141
  8. Friedhelm Meyer auf der Heide
    Pages 142-152
  9. Jean-Pierre Pécuchet
    Pages 180-191
  10. Christine Duboc
    Pages 192-202
  11. Ph. Darondeau
    Pages 203-212
  12. C. Choffrut, M. P Schutzenberger
    Pages 213-226
  13. Ursula Schmidt
    Pages 227-235

About these proceedings

Keywords

Monoid Notation algorithms automata complexity computer logic proof

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-16078-7
  • Copyright Information Springer-Verlag 1986
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-16078-6
  • Online ISBN 978-3-540-39758-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349