Normal view MARC view ISBD view

Introduction to computer theory / Daniel I.A. Cohen

By:

Cohen, Daniel I. A [author]

Material type: Text

TextPublication details: New York : Wiley, c1997Edition: Revised editionDescription: xii, 838 pages : illustrations ; 24 cmISBN:

471137723

Subject(s):

ELECTRONIC DITIGAL COMPUTERS

LOC classification:

QA 76.5 .C64 1997

Contents:

UTOMATA THEORY. Background. Languages. Recursive Definitions. Regular Expressions. Finite Automata. Transition Graphs. Kleene's Theorem. Finite Automata with Output. Regular Languages. Nonregular Languages. Decidability. PUSHDOWN AUTOMATA THEORY. Context-Free Grammars. Grammatical Format. Pushdown Automata. CFG = PDA. Non-Context-Free Languages. Context-Free Languages. Decidability. TURING THEORY. Turing Machines. Post Machines. Minsky's Theorem. Variations on the TM. TM Languages. The Chomsky Hierarchy. Computers. Bibliography. Indexes.

Summary: This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

Item type:

Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	National University - Manila	LRC - Main General Circulation	Computer Science	GC QA 76.5 .C64 1997 (Browse shelf(Opens below))	c.1	Available		NULIB000002354

Includes bibliographical references and index.

This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

There are no comments on this title.

to post a comment.