Theory of automata and computation / (Record no. 32637)

MARC details
000 -LEADER
fixed length control field 02163nam a2200313 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field CSPC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260714102841.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 260714s2011 ii a 001 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9789350141571
040 ## - CATALOGING SOURCE
Original cataloging agency CSPC
Language of cataloging eng
Transcribing agency CSPC
Description conventions rda
050 00 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA267
Item number .P362011
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
Item number P192t
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Pandey, Adesh Kumar,
Relator term author.
245 10 - TITLE STATEMENT
Title Theory of automata and computation /
Statement of responsibility, etc. Adesh Kumar Pandey.
250 ## - EDITION STATEMENT
Edition statement First edition.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture New Delhi, India :
Name of producer, publisher, distributor, manufacturer S.K. Kataria & Sons,
Date of production, publication, distribution, manufacture, or copyright notice 2011 ; Reprint 2022.
300 ## - PHYSICAL DESCRIPTION
Extent 315 pages :
Other physical details illustrations ;
Dimensions 24 cm.
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
337 ## - MEDIA TYPE
Source rdamedia
Media type term unmediated
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term volume
500 ## - GENERAL NOTE
General note Includes index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Section-A: Finite automata -- Regular expression -- Introduction to machines -- Section-B: Properties of regular sets -- Context-free grammars and languages -- Simplified context-free grammar and its normal form -- Section-C: Pushdown automata -- Properties of context-free languages -- Turing machine -- Section-D: Chomsky heirarchies -- Computability and recursive function theory.
520 ## - SUMMARY, ETC.
Summary, etc. "The book addresses a full spectrum of automata theory concepts used in computer science. Each of these concepts is presented in detail, since these concepts are basis of computer science and provide the basics for developing software techniques like designing and checking the behaviour of digital circuits, lexical-analyser of the typical compiler, and software for Natural Language Processing. To introduce the more formal aspects of Computer Science, the author has presented automata as foundation. For students who are ambitious to achieve unparalleled goals in the field of computer science, and want to develop their programming skills towards system programming, it becomes necessary that their mathematical concept are very clear"-- Preface of the book.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Machine theory.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computational complexity.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Recursion theory.
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Suppress in OPAC No
Koha item type Books
Item part P192t
Call number prefix CIR
Call number suffix 2011
Edition 23
Classification part 005.131
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
    Dewey Decimal Classification     Main Library Main Library Circulation Section 07/14/2026   CIR 005.131 P192t 2011 031911 07/14/2026 1-1 07/14/2026 Books