03791nam a22004095i 4500001001800000003000900018005001700027007001500044008004100059020001800100020001900118024003500137082001700172100002900189245008400218264005900302300003400361336002600395337002600421338003600447347002400483505052200507520187801029650002202907650002402929650002202953650002702975650004303002710003403045773002003079776003603099856010103135912001403236942001203250999001703262952010203279978-0-85729-535-4DE-He21320260521092040.0cr nn 008mamaa110429s2011    xxk|    s    |||| 0|eng d  a9780857295354  a997808572953547 a10.1007/978-0-85729-535-42doi04a004.01512231 aMaruoka, Akira.eauthor.10aConcise Guide to Computation Theoryh[electronic resource] /cby Akira Maruoka. 1aLondon :bSpringer London :bImprint: Springer,c2011.  aXVII, 281p.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda0 aPart 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.  aComputation 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. 0aCOMPUTER SCIENCE. 0aINFORMATION THEORY.14aCOMPUTER SCIENCE.24aTHEORY OF COMPUTATION.24aCOMPUTATIONAL SCIENCE AND ENGINEERING.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z978085729534740uhttp://dx.doi.org/10.1007/978-0-85729-535-4zVer el texto completo en las instalaciones del CICY  aZDB-2-SCS  2ddccER  c35990d35990  00102ddc40708LEaCICYbCICYcELd2025-10-06l0o004.0151r2025-10-06 08:44:44w2025-10-06yER