Book Volume 1337 1997

Foundations of Computer Science

Potential — Theory — Cognition

Editors:

ISBN: 978-3-540-63746-2 (Print) 978-3-540-69640-7 (Online)

Table of contents (49 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. No Access

    Chapter

    Pages 1-8

    The might of formulas and their limits

  3. No Access

    Chapter

    Pages 9-19

    Hardware — Software

  4. No Access

    Chapter

    Pages 21-35

    Defining discipline

  5. No Access

    Chapter

    Pages 37-47

    Computer science as cultural development

  6. No Access

    Chapter

    Pages 49-67

    Towards adjusting informatics education to information era

  7. No Access

    Chapter

    Pages 69-78

    Informatics and society: A curriculum for distance education

  8. No Access

    Chapter

    Pages 79-105

    Syntactic and semantic aspects of parallelism

  9. No Access

    Chapter

    Pages 107-115

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

  10. No Access

    Chapter

    Pages 117-124

    On abstract families of languages, power series, and elements

  11. No Access

    Chapter

    Pages 125-134

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

  12. No Access

    Chapter

    Pages 135-142

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

  13. No Access

    Chapter

    Pages 143-152

    An automata approach to some problems on context-free grammars

  14. No Access

    Chapter

    Pages 153-162

    On aperiodic sets of Wang tiles

  15. No Access

    Chapter

    Pages 163-175

    Closure under complementation of logspace complexity classes - A survey -

  16. No Access

    Chapter

    Pages 177-184

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

  17. No Access

    Chapter

    Pages 185-199

    A foundation for computable analysis

  18. No Access

    Chapter

    Pages 201-208

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

  19. No Access

    Chapter

    Pages 209-217

    Calendars and chronologies

  20. No Access

    Chapter

    Pages 219-231

    A uniform approach to Petri Nets

  21. No Access

    Chapter

    Pages 233-238

    Observing partial order runs of Petri Nets

previous Page of 3