Skip to main content
SpringerLink
Log in

Foundations of Computer Science

Potential-Theory-Cognition

  • Book
  • © 1997

Overview

Editors:
  1. Christian Freksa
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Matthias Jantzen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Rüdiger Valk
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1337)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (49 chapters)

  1. Front Matter

    Download chapter PDF

  2. The might of formulas and their limits

    • F. L. Bauer
    Pages 1-8

  3. Hardware — Software

    • Heinz Zemanek
    Pages 9-19

  4. Defining discipline

    • Wolfgang Coy
    Pages 21-35

  5. Computer science as cultural development

    • Dirk Siefkes
    Pages 37-47

  6. Towards adjusting informatics education to information era

    • Jozef Gruska, Roland Vollmar
    Pages 49-67

  7. Informatics and society: A curriculum for distance education

    • Herbert Klaeren, Christiane Floyd, Friedrich Diestelmeier
    Pages 69-78

  8. Syntactic and semantic aspects of parallelism

    • Alexandru Mateescu, Grzegorz Rozenberg, Arto Salomaa
    Pages 79-105

  9. Unique fixpoints in complete lattices with applications to formal languages and semantics

    • Ingbert Kupka
    Pages 107-115

  10. On abstract families of languages, power series, and elements

    • Georg Karner, Werner Kuich
    Pages 117-124

  11. Are there formal languages complete for SymSPACE(log n)?

    • Klaus -Jörn Lange
    Pages 125-134

  12. On twist-closed trios: A new morphic characterization of r.e. sets

    • Matthias Jantzen
    Pages 135-142

  13. An automata approach to some problems on context-free grammars

    • J. Esparza, P. Rossmanith
    Pages 143-152

  14. On aperiodic sets of Wang tiles

    • Karel Culik, Jarkko Kari
    Pages 153-162

  15. Closure under complementation of logspace complexity classes - A survey -

    • Birgit Jenner
    Pages 163-175

  16. A relation between sparse and printable sets in NSPACE(log n)

    • Bernd Kirsig
    Pages 177-184

  17. A foundation for computable analysis

    • Klaus Weihrauch
    Pages 185-199

  18. A computer scientist's view of life, the universe, and everything

    • Jürgen Schmidhuber
    Pages 201-208

  19. Calendars and chronologies

    • Manfred Kudlek
    Pages 209-217

  20. A uniform approach to Petri Nets

    • H. Ehrig, J. Padberg
    Pages 219-231
Back to top

Keywords

About this book

This book constitutes an anthology of refereed papers arranged to acknowledge the work of Wilfried Brauer on the occasion of his sixtieth birthday. The volume presents 49 revised refereed papers organized in topical sections on computer science and its potential, social implications of computer science, formal languages and automata, structures and complexity theory, Petri nets, systems analysis and distributed systems, software engineering and verification, cognition and artificial intelligence, knowledge representation and reasoning, machine learning, neural networks and robotics, language and information systems.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation