ShopSpell

Foundations of Computer Science Potential-Theory-Cognition [Paperback]

$81.99     $109.99    25% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  354063746X
  • ISBN-10:  354063746X
  • ISBN-13:  9783540637462
  • ISBN-13:  9783540637462
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  524
  • Pages:  524
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-1997
  • Pub Date:  01-Feb-1997
  • SKU:  354063746X-11-SPRI
  • SKU:  354063746X-11-SPRI
  • Item ID: 100781714
  • List Price: $109.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 05 to Jul 07
  • Notes: Brand New Book. Order Now.
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.The might of formulas and their limits.- Hardware  Software.- Defining discipline.- Computer science as cultural development.- Towards adjusting informatics education to information era.- Informatics and society: A curriculum for distance education.- Syntactic and semantic aspects of parallelism.- Unique fixpoints in complete lattices with applications to formal languages and semantics.- On abstract families of languages, power series, and elements.- Are there formal languages complete for SymSPACE(log n)?.- On twist-closed trios: A new morphic characterization of r.e. sets.- An automata approach to some problems on context-free grammars.- On aperiodic sets of Wang tiles.- Closure under complementation of logspace complexity classes - A survey -.- A relation between sparse and printable sets in NSPACE(log n).- A foundation for computable analysis.- A computer scientist's view of life, the universe, and everything.- Calendars and chronologies.- A uniform approach to Petri Nets.- Observing partial order runs of Petri Nets.- Representation theorems for Petri Nets.- A remark on trace equations.- Verification of distributed algorithms with algebraic Petri Nets.- A short story on action refinement.- Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositionality and all that.- Discrete time analysis of a stalc,
Add Review