Introduction to computer theory / (Record no. 4595)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01528nam a2200229Ia 4500 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | NULRC |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20250520094847.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 250520s9999 xx 000 0 und d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 471137723 |
040 ## - CATALOGING SOURCE | |
Transcribing agency | NULRC |
050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA 76.5 .C64 1997 |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Cohen, Daniel I. A. |
Relator term | author |
245 #0 - TITLE STATEMENT | |
Title | Introduction to computer theory / |
Statement of responsibility, etc. | Daniel I.A. Cohen |
250 ## - EDITION STATEMENT | |
Edition statement | Revised edition. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Place of publication, distribution, etc. | New York : |
Name of publisher, distributor, etc. | Wiley, |
Date of publication, distribution, etc. | c1997 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | xii, 838 pages : |
Other physical details | illustrations ; |
Dimensions | 24 cm. |
504 ## - BIBLIOGRAPHY, ETC. NOTE | |
Bibliography, etc. note | Includes bibliographical references and index. |
505 ## - FORMATTED CONTENTS NOTE | |
Formatted contents note | 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. |
520 ## - SUMMARY, ETC. | |
Summary, etc. | 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. |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | ELECTRONIC DITIGAL COMPUTERS |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | Library of Congress Classification |
Koha item type | Books |
Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Total checkouts | Full call number | Barcode | Date last seen | Copy number | Price effective from | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Library of Congress Classification | Computer Science | LRC - Main | National University - Manila | General Circulation | 11/05/2011 | Reaccessioned | GC QA 76.5 .C64 1997 | NULIB000002354 | 05/20/2025 | c.1 | 05/20/2025 | Books |