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.
Akira Maruoka
Concise Guide to Computation Theory [PDF ebook]
Concise Guide to Computation Theory [PDF ebook]
Beli ebook ini dan dapatkan 1 lagi PERCUMA!
Bahasa Inggeris ● Format PDF ● ISBN 9780857295354 ● Penerbit Springer London ● Diterbitkan 2011 ● Muat turun 3 kali ● Mata wang EUR ● ID 4625049 ● Salin perlindungan Adobe DRM
Memerlukan pembaca ebook yang mampu DRM