Advertisement

Table of contents

  1. Front Matter
  2. Werner Kuich
    Pages 5-12
  3. Franz-Josef Brandenburg
    Pages 13-21
  4. J. Avenhaus, K. Madlener
    Pages 42-51
  5. Ioannis Keklikoglou
    Pages 70-75
  6. Henk J. Olivié
    Pages 98-108
  7. John Hopcroft
    Pages 123-134
  8. J. J. Pansiot
    Pages 152-158
  9. Bernhard Josko
    Pages 184-194
  10. Klaus Weihrauch
    Pages 195-202
  11. Herbert A. Klaeren, Martin Schulz
    Pages 203-213
  12. Horst Müller
    Pages 214-223
  13. Scott Huddleston, Kurt Mehlhorn
    Pages 234-244
  14. L. Boasson, M. Nivat
    Pages 245-251
  15. R. Book, M. Jantzen, C. Wrathall
    Pages 252-260
  16. Back Matter

About these proceedings

Keywords

Alphabet Boolean function Computer Informatik algorithm algorithms automata complexity complexity theory formal language

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0017288
  • Copyright Information Springer-Verlag Berlin Heidelberg 1981
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-10576-3
  • Online ISBN 978-3-540-38561-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
Electronics
IT & Software
Telecommunications