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.
發表於2024-11-27
Concise Guide to Computation Theory 2024 pdf epub mobi 電子書 下載
圖書標籤: 計算理論 計算機科學 圖靈機 Theory Springer Computation 2011
弱
評分弱
評分弱
評分弱
評分弱
Concise Guide to Computation Theory 2024 pdf epub mobi 電子書 下載