Introduction to Computer Theory / (Record no. 13634)

MARC details
000 -LEADER
fixed length control field 01673nam a2200241 a 4500
001 - CONTROL NUMBER
control field vtls000002103
003 - CONTROL NUMBER IDENTIFIER
control field VRT
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250102223854.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 081117s1997 nyua |b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0471137723
039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE]
Level of rules in bibliographic description 201402040103
Level of effort used to assign nonsubject heading access points VLOAD
Level of effort used to assign subject headings 201007271055
Level of effort used to assign classification malmash
Level of effort used to assign subject headings 200811221004
Level of effort used to assign classification venkatrajand
Level of effort used to assign subject headings 200811171125
Level of effort used to assign classification Noora
-- 200811171125
-- Noora
050 04 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.5
Item number .C558 1997
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Cohen, Daniel I. A.,
Dates associated with a name 1946-
9 (RLIN) 31636
245 10 - TITLE STATEMENT
Title Introduction to Computer Theory /
Statement of responsibility, etc. Daniel I.A. Cohen.
250 ## - EDITION STATEMENT
Edition statement 2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New York ;
-- Chichester :
Name of publisher, distributor, etc. Wiley,
Date of publication, distribution, etc. c1997.
300 ## - PHYSICAL DESCRIPTION
Extent xiv, 634 p. :
Other physical details ill. ;
Dimensions 27 cm.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliography (p. 619-620) and index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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.
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 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Electronic digital computers.
9 (RLIN) 1960
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Suppress in OPAC No
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification     Library Library First Floor 21/12/2024   QA76.5 .C558 1997 8812 21/12/2024 1 21/12/2024 Books
New Arrivals

Loading...

Contact Us

Library: Location maps

Phone: 00968 2323 7091 Email: Ask us a question

Library Hours

Sunday - Thursday 7:30AM - 8:00 PM

Friday - Saturday Closed