Concise guide to computation theory / (Record no. 12961)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01829nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250520102659.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 | 9780857295347 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA 267.7 .M37 2011 |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Maruoka, Akira |
| Relator term | author |
| 245 #0 - TITLE STATEMENT | |
| Title | Concise guide to computation theory / |
| Statement of responsibility, etc. | Akira Maruoka |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | London, United Kingdom : |
| Name of publisher, distributor, etc. | Springer-Verlag, |
| Date of publication, distribution, etc. | c2011 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xvii, 281 pages : |
| Other physical details | illustrations ; |
| Dimensions | 25 cm.USD |
| 365 ## - TRADE PRICE | |
| Price amount | USD49.7 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | pt. 1. The theory of computation -- pt. 2. Automata and languages -- pt. 3. Computability -- pt. 4. Complexity of computation -- pt. 5. Conclusions and exercise solutions. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | This textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author’s extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | COMPUTER SCIENCE |
| 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 | Multimedia Arts and Animation | LRC - Main | National University - Manila | General Circulation | 05/25/2016 | Purchased - Amazon | 49.70 | GC QA 267.7 .M37 2011 | NULIB000010720 | 05/20/2025 | c.1 | 05/20/2025 | Books |