| 000 -LEADER |
|---|
| fixed length control field |
03645nam a22003975i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151109.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
110429s2011 xxk| s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780857295354 |
|
978-0-85729-535-4 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA75.5-76.95 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.0151 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
London : |
| -- |
Springer London : |
| -- |
Imprint: Springer, |
| -- |
2011. |
| 912 ## - |
|---|
| -- |
ZDB-2-SCS |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Maruoka, Akira. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Concise Guide to Computation Theory |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc |
by Akira Maruoka. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XVII, 281p. |
| Other physical details |
online resource. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Part I: The Theory of Computation -- Everything Begins With Computation -- Preliminaries to the Theory of Computation -- Part II: Automata and Languages -- Finite Automata -- Context-Free Languages -- Pushdown Automaton -- Part III: Computability -- Turing Machine -- Universality of Turing Machine and its Limitation -- Part IV: Complexity of Computation -- Computational Complexity Based on Turing Machines -- Computational Complexity Based on Boolean Circuits -- NP-Completeness -- Solutions -- Concluding Remarks. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
Computation lies at the heart of modern digital technology and our increasingly advanced information society. The theory of computation describes what tasks can and cannot be computed, and how efficiently the computable tasks can be computed. This focused and accessible guide/textbook presents a thorough foundation to the theory of computation, whilst also providing a deeper insight for those looking to pursue research in this field. 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. Self-contained and supported by practical examples, the text is suitable for a one- or two-semester undergraduate course in the theory 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 This hands-on and easy-to-read textbook/reference is ideal for undergraduate students of computer science and related disciplines needing to develop a deep understanding of this fascinating field, even if they have no prior knowledge of the subject. Dr. Akira Maruoka is a professor in the Faculty of Science and Engineering at Ishinomaki Senshu University, Japan. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science. |
|
|---|
| Topical term or geographic name as entry element |
Information theory. |
|
|---|
| Topical term or geographic name as entry element |
Computer Science. |
|
|---|
| Topical term or geographic name as entry element |
Theory of Computation. |
|
|---|
| Topical term or geographic name as entry element |
Computational Science and Engineering. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9780857295347 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-0-85729-535-4 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
