计算理论
计算理论导引(原书第3版)
Introduction to the Theory of Computation Douban
[美] Michael Sipser translator: 段磊 / 唐常杰 … publishing house: 机械工业出版社 2015 - 8
《计算理论导引(原书第3版)》由计算理论领域的知名权威 Michael Sipser 所撰写。他以独特的视角,系统地介绍了计算理论的三个主要内容:自动机与语言、可计算性理论和计算复杂性理论。作者以清新的笔触、生动的语言给出了宽泛的数学原理,而没有拘泥于某些低层次的细节。在证明之前,均有“证明思路”,帮助读者理解数学形式下蕴涵的概念。本书可作为计算机专业高年级本科生和研究生的教材,也可作为教师和研究人员的参考书。
Read
Dec. 16, 2020
一些重要细节翻译有误,造成理解上的困难甚至根本就是错误的,比如Myhill–Nerode定理的证明以及空间可构造性、时间可构造性的定义。
递归论 TCS 计算理论 计算机科学 逻辑学
Introduction to the Theory of Computation
Douban
★ 9.7 6 ratings
Michael Sipser publishing house: Cengage Learning 2012 - 6
Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. You gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E's comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing.
Read
Dec. 16, 2020
或许是最好的计算理论教材,从最基础的有穷自动机讲起,直至将Kolmogorov complexity和交互式证明系统这样的概念以自然的方式呈现在读者眼前。Sipser属于那种教学经验丰富、深谙把复杂证明讲得深入浅出之道的作者。这一版还增加了对确定型下推自动机以及LR(k)文法的讨论,对于关心自动机应用的读者来说,几乎可以和编译龙书无缝衔接。
递归论 TCS 计算理论 计算机科学 逻辑学
可计算性与计算复杂性导引
Douban
张立昂 publishing house: 北京大学出版社 2011 - 8
《可计算性与计算复杂性导引(第3版)》是学习计算理论的教材和参考书,内容包括三部分:可计算性、形式语言与自动机、计算复杂性,主要介绍几种计算模型及它们的等价性,函数、谓词和语言的可计算性等基本概念,形式语言及其对应的自动机模型,时间和空间复杂性,NP完全性等。 《可计算性与计算复杂性导引(第3版)》可作为计算机专业本科生和研究生的教材,也可作为从事计算机科学技术的研究和开发人员的参考书,还可作为对计算理论感兴趣的读者的入门读物。
Read
Nov. 10, 2020
讲法与一般的计算理论教材(Sipser、Hopcroft)由弱到强的顺序相反,可作参考。同时也继承了这套书只适合作课堂讲义或参考,自学几乎不可读的特性。
递归论 TCS 计算理论 计算机科学 逻辑学
Introduction to Automata Theory, Languages, and Computation
Douban
John E. Hopcroft / Rajeev Motwani … publishing house: Addison Wesley 2006 - 7
This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students. By using a series of "root questions" and hints, it not only tests a student's capability, but actually simulates a one-on-one teacher-student tutorial that allows for the student to more easily learn the material. Through the programming labs, instructors are capable of testing, tracking, and honing their students' skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered. For more information about Gradiance, please visit www.aw.com/gradiance.