My Library

University LibraryCatalogue

Limit search to items available for borrowing or consultation
Result Page: Previous Next
Can't find that book? Try BONUS+
Look for full text

Search Discovery

Search CARM Centre Catalogue

Search Trove

Add record to RefWorks

Book Cover
Author Davis, Martin, 1928-

Title Computability, complexity, and languages : fundamentals of theoretical computer science / Martin D. Davis, Ron Sigal, Elaine J. Weyuker.

Published Boston : Academic Press, Harcourt, Brace, 1994.


Location Call No. Status
 UniM Store Engin  511.3 DAVI    AVAILABLE
Edition 2nd. ed.
Physical description xix, 609 pages : illustrations ; 24 cm.
Series Computer science and scientific computing.
Computer science and scientific computing.
Bibliography Includes bibliographical references (pages 593-594) and index.
Summary This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
Other author Weyuker, Elaine J.
Sigal, Ron.
Subject Machine theory.
Computational complexity.
Formal languages.
ISBN 0122063821 (acid-free paper)