Introduction to Computer Theory / Daniel I.A. Cohen.

By:

Cohen, Daniel I. A, 1946-

Material type: Text

TextPublication details: New York ; Chichester : Wiley, c1997.Edition: 2nd edDescription: xiv, 634 p. : ill. ; 27 cmISBN:

0471137723

Subject(s):

Electronic digital computers

LOC classification:

QA76.5 .C558 1997

Contents:

AUTOMATA 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.

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	Call number	Copy number	Status	Barcode
Books	Library First Floor	QA76.5 .C558 1997 (Browse shelf(Opens below))	1	Available	8812

Includes bibliography (p. 619-620) 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.

Introduction to Computer Theory / Daniel I.A. Cohen.

Contact Us

Library Hours