Theory of computation / Derick Wood.
By: Wood, Derick [author]
.
Material type: 
BookPublisher: New York : Wiley, [1987]Copyright date: ©1987Description: xviii, 558 pages : illustrations ; 24 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 0471613096 (paperback).Subject(s): Computational complexity | Machine theory | Computer science -- MathematicsDDC classification: 511.3 | Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
| General lending | MTU Bishopstown Library Lending | 511.3 (Browse shelf(Opens below)) | 1 | Available | 00030461 |
Enhanced descriptions from Syndetics:
Intended to be used as the basis of a one- or two-term introductory course in the theory of computation, this book concentrates on the fundamental models for languages and computation together with their properties. It contains simple proofs of many results that are usually considered difficult. For example the proof given to show that every finite automaton has an equivalent regular expression is little known.
Bibliography: (pages 531-546) and index.
Part I: Introduction -- Part II: Models -- Part III: Properties -- Part IV: Onward.