Introduction to languages and the theory of computation / (Record no. 13557)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02859cam a22002654a 4500 |
| 001 - CONTROL NUMBER | |
| control field | vtls000001420 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | VRT |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250102223850.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 081102s2003 maua |b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 0072322004 (alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 0071198547 (International ed. : alk. paper) |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] | |
| Level of rules in bibliographic description | 201402040051 |
| Level of effort used to assign nonsubject heading access points | VLOAD |
| Level of effort used to assign subject headings | 201007211209 |
| Level of effort used to assign classification | malmash |
| Level of effort used to assign subject headings | 200811020803 |
| Level of effort used to assign classification | Noora |
| Level of effort used to assign subject headings | 200811020800 |
| Level of effort used to assign classification | Noora |
| -- | 200811020800 |
| -- | Noora |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA267.5.S4 |
| Item number | M29 2003 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Martin, John C. |
| 9 (RLIN) | 31527 |
| 245 10 - TITLE STATEMENT | |
| Title | Introduction to languages and the theory of computation / |
| Statement of responsibility, etc. | John C. Martin. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 3rd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | Boston : |
| Name of publisher, distributor, etc. | McGraw-Hill, |
| Date of publication, distribution, etc. | c2003. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xiii, 543 p. : |
| Other physical details | ill. ; |
| Dimensions | 24 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Includes bibliographical references (p. 529-530) and indexes. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Mathematical Notation and Techniques1 Basic Mathematical Objects2 Mathematical Induction and Recursive DefinitionsII Regular Languages and Finite Automata3 Regular Expressions and Finite Automata4 Nondeterminism and Kleene's Theorem5 Regular and Nonregular LanguagesIII Context-Free Languages and Pushdown Automata6 Context-Free Grammars7 Pushdown Automata8 Context-Free and Non-Context-Free LanguagesIV Turing Machines and Their Languages9 Turing Machines10 Recursively Enumerable LanguagesV Unsolvable Problems and Computable Functions11 Unsolvable Problems12 Computable FunctionsVI Introduction to Computational Complexity13 Measuring and Classifying Complexity14 Tractable and Intractable Problems |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Introduction to Languages and the Theory of Computation is an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness. Through the study of these topics, students encounter profound computational questions and are introduced to topics that will have an ongoing impact in computer science. Once students have seen some of the many diverse technologies contributing to computer science, they can also begin to appreciate the field as a coherent discipline. A distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used. Martin takes advantage of the clarity and precision of mathematical language, but also provides discussion and examples that make the language intelligible to those just learning to read and speak it. The material is designed to be accessible to students who do not have a strong background in discrete mathematics, but it is also appropriate for students who have had some exposure to discrete math, but whose skills in this area need to be consolidated and sharpened. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Sequential machine theory. |
| 9 (RLIN) | 18274 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computable functions. |
| 9 (RLIN) | 31528 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Library of Congress Classification |
| Suppress in OPAC | No |
| Koha item type | Books |
| 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 | QA267.5.S4 M29 2003 | 8631 | 21/12/2024 | 1 | 21/12/2024 | Books |