Introduction to computer theory / Daniel I.A. Cohen
Material type:
- 471137723
- QA 76.5 .C64 1997

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Main General Circulation | Computer Science | GC QA 76.5 .C64 1997 (Browse shelf(Opens below)) | c.1 | Available | NULIB000002354 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
![]() |
![]() |
No cover image available | No cover image available | No cover image available |
![]() |
No cover image available | ||
GC QA 76.3 .R84 2008 Network fundamentals : CCNA exploration labs and study guide / | GC QA 76.3 .V37 2016 CISCO CCNA Networking for beginners : the ultimate beginners crash course to learn Cisco quickly and easily / | GC QA 76.5 .C37 1998 Computers : tools for an information age / | GC QA 76.5 .C64 1997 Introduction to computer theory / | GC QA 76.5 .C67 1991 PC applications lab manual / | GC QA 76.5 .H88 1990 Computers : the user perspective / | GC QA 76.5 .H88 1992 Computers : the user perspective / |
Includes bibliographical references and index.
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.
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.