Formal languages and automata theory / (Record no. 12001)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01810nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250520100715.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 | 9780198071068 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA 267.3 .N34 2011 |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Nagpal, C.K. |
| Relator term | author |
| 245 #0 - TITLE STATEMENT | |
| Title | Formal languages and automata theory / |
| Statement of responsibility, etc. | C.K. Nagpal |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | Oxford, United Kingdom : |
| Name of publisher, distributor, etc. | Oxford University Press, |
| Date of publication, distribution, etc. | c2011 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xiv, 348 pages : |
| Other physical details | illustrations ; |
| Dimensions | 24 cm. |
| 365 ## - TRADE PRICE | |
| Price amount | USD8.42 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1. Automata, formal languages and computability -- 2. Mathematical preliminaries -- 3. Finite automata -- 4. Regular grammar and regular sets -- 5. Context-free grammars and languages -- 6. Pushdown automata -- 7. Turing machines -- 8. The pitfall of algorithmic computing: undecidability -- 9. Computable functions -- 10. Computational complexity: tractable and possibly intractable problems. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | FORMAL LANGUAGES |
| 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 | Cost, normal purchase price | Total checkouts | Full call number | Barcode | Date last seen | Copy number | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Library of Congress Classification | Machine Learning | LRC - Main | National University - Manila | General Circulation | 06/30/2015 | Purchased - Amazon | 8.42 | GC QA 267.3 .N34 2011 c.1 | NULIB000009760 | 05/20/2025 | c.1 | 05/20/2025 | Books | |||||
| Library of Congress Classification | Gen. Ed. - CCIT | LRC - Graduate Studies | National University - Manila | General Circulation | 06/30/2015 | Purchased - Amazon | 8.42 | GC QA 267.3 .N34 2011 c.2 | NULIB000011338 | 06/18/2025 | c.2 | 05/20/2025 | Books |