Advertisement

Table of contents

  1. Front Matter
  2. Andrzej J. Blikle
    Pages 26-42
  3. Ronald V. Book
    Pages 43-56
  4. Rūsiņš Freivalds
    Pages 57-69
  5. Ivan M. Havel
    Pages 89-107
  6. M. C. B. Hennessy, G. D. Plotkin
    Pages 108-120
  7. Kurt Mehlhorn
    Pages 131-145
  8. Robin Milner
    Pages 146-159
  9. Vaughan R. Pratt
    Pages 160-169
  10. Arto Salomaa
    Pages 170-181
  11. Derick Wood
    Pages 191-200
  12. Akeo Adachi, Takumi Kasai, Etsuro Moriya
    Pages 201-207
  13. H. Andréka, I. Németi, I. Sain
    Pages 208-218
  14. Jean-Michel Autebert
    Pages 219-227
  15. G. Comyn, G. Werner
    Pages 228-236
  16. G. Cousineau, P. Enjalbert
    Pages 237-245
  17. K. Culik II, J. Karhumäki
    Pages 246-257
  18. Alla Goralčíková, Václav Koubek
    Pages 301-307
  19. Ľudmila Gregušová, Ivan Korec
    Pages 308-316
  20. Tsutomu Kamimura, Giora Slutzki
    Pages 317-325
  21. Manfred Kudlek
    Pages 346-353
  22. Matti Linna, Martti Penttonen
    Pages 354-362
  23. Kurt Mehlhorn
    Pages 375-380
  24. Grazyna Mirkowska
    Pages 381-389
  25. Anton Nijholt, Eljas Soisalon-Soininen
    Pages 390-397
  26. Peter H. Starke
    Pages 425-433
  27. B. A. Trakhtenbrot
    Pages 453-462
  28. Věra Trnková
    Pages 463-473
  29. Klaus Wagner
    Pages 492-498

About these proceedings

Keywords

Approximation Graph Information Turing machine algorithms automata calculus complexity cryptography formal language information theory logic programming language sets verification

Bibliographic information

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