Theoretical foundations of computer science / Dino Mandrioli and Carlo Ghezzi

By: Contributor(s): Material type: TextTextPublication details: New York : John Wiley & Son, Inc., c1987Description: xxv, 471 pages : illustrations ; 24 cmISBN:
  • 471838349
Subject(s): LOC classification:
  • QA 39.2 .M36 1987
Contents:
Chapter 0. Mathematical Background -- Chapter 1. Models For Computer Science Automata And Grammars -- Chapter 2. Solvable And Unsolvable Problems -- Chapter 3. The Complexity Of Computing -- Chapter 4. Formal Semantics -- Chapter 5. Proving Program Properties -- Chapter 6. Nondeterminism And Parallel Computation.
Summary: The contents and organization of this book have been used experimentally in numerous courses both in universities and in intensive industrial courses.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Annex General Circulation Secondary Education - Mathematics GC QA 39.2 .M36 1987 c.1 (Browse shelf(Opens below)) c.1 Available NULIB000002342
Books Books National University - Manila LRC - Annex Relegation Room Secondary Education - Mathematics GC QA 39.2 .M36 1987 c.2 (Browse shelf(Opens below)) c.2 Available NULIB000002348
Browsing LRC - Annex shelves, Shelving location: General Circulation, Collection: Secondary Education - Mathematics Close shelf browser (Hides shelf browser)
No cover image available
No cover image available
No cover image available
No cover image available
GC QA 39.2 .L33 1991 c.4 Finite mathematics / GC QA 39.2 .L33 1991 c.5 Finite mathematics / GC QA 39.2 .L33 1991 c.6 Finite mathematics / GC QA 39.2 .M36 1987 c.1 Theoretical foundations of computer science / GC QA 39.3 .R65 2008 Finite mathematics / GC QA 76.9 .K64 2018 Discrete mathematical structures / GC QA 107.2 .H35 2007 Saxon math : course 3 /

Includes index.

Chapter 0. Mathematical Background -- Chapter 1. Models For Computer Science Automata And Grammars -- Chapter 2. Solvable And Unsolvable Problems -- Chapter 3. The Complexity Of Computing -- Chapter 4. Formal Semantics -- Chapter 5. Proving Program Properties -- Chapter 6. Nondeterminism And Parallel Computation.

The contents and organization of this book have been used experimentally in numerous courses both in universities and in intensive industrial courses.

There are no comments on this title.

to post a comment.