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]
购买此电子书可免费获赠一本!
语言 英语 ● 格式 PDF ● ISBN 9780857295354 ● 出版者 Springer London ● 发布时间 2011 ● 下载 3 时 ● 货币 EUR ● ID 4625049 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器