自动机理论、语言和计算导论
Introduction to automata theory, languages, and computation
John E. Hopcroft、Jeffrey D. Ullman、Rajeev Motwani · 初版 1979 年
24人推荐
33位读者提及
37次提及
为什么值得读
- 平易近人地讲解状态机与正则表达式的关联
- 清晰阐释P与NP等深刻的理论计算机概念
- 经典计算机科学基础，避免实践中误用工具
“这本关于形式语言、自动机理论与计算复杂性的经典著作已进行更新，以简洁直观的方式呈现理论概念，并增加了对实际应用的探讨。第三版为学生提供了更为通俗的写作风格，同时提供了最为平易近人的自动机理论讲解、扎实的证明构建指导、丰富的图表以帮助阐明观点，以及突出相关内容的边栏。本版的一大新特色是引入了基于网页的作业与评估工具Gradiance。每一章都提供
Hacker News 上怎么说
正在加载完整评论……
……从这里面列个清单。另外，有些作品你闭着眼睛读都不会踩雷。比如：-《计算机程序的构造和解释》（SICP），Abelson 和 Sussman -《算法》，Sedgewick, Wayne -《自动机理论、语言和计算导论》，Hopcroft, Motwani, Ullman。还有一些相对小众但巨有意思的书：-《纯函数式数据结构》，Chris Okasaki -《The Reasoned Schemer》，Friedman, Byrd, Kiselyov（或者找本优秀的 Prolog 书）。之后……
…list from that. Also, there are some works where you really can't go wrong. Some examples: - Structure and Interpretation of Computer Programs, Abelson and Sussman - Algorithms, Sedgewick, Wayne - Introduction to Automata Theory, Languages, and Computation, Hopcroft, Motwani, Ullman Lesser known, but incredibly fun books: - Purely Functional Data Structures, Chris Okasaki - The Reasoned Schemer, Friedman, Byrd, Kiselyov (or a good Prolog book). After…
《计算机程序的构造和解释》（SICP）、《自动机理论、语言和计算导论》（Hopcroft Ullman）、高德纳的《计算机程序设计艺术》（TAOCP）、Tanenbaum 的《现代操作系统》、以及《编译原理》（龙书，Aho Sethi Ullman）
Structure and Interpretation of Computer Programs (), Introduction to Automata Theory, Languages and Computation (Hopcroft Ullman), don knuth's art of computer programming, Tanenbaum's Modern Operating Systems, Compilers: Principles, Techniques, and Tools5 (Aho Sethi Ullman)
Hopcroft 和 Ullman 写的《自动机理论、语言和计算导论》里关于状态机以及它与正则表达式（regex）联系的那一章写得非常好
Hopcroft Ullman's Introduction to Automata Theory, Languages and Computation has good section on state machines and their connection to Regular Expressions
有一本我会向所有人推荐的书是《自动机理论、语言和计算导论》（HMU 那本）。它非常通俗易懂，而且讲了一些极其硬核有趣的课题（读了它你就不会想着用 regex 去 match HTML 了，而且能搞懂 P 与 NP 问题到底是啥意思）。从更实用的角度来看，我觉得必读的……
One book that I would suggest to anyone is Introduction to Automata Theory, Languages, and Computation - HMU. It is very approachable and presents some very interesting topics (so you won't write a regex for matching HTML and will learn what P vs NP means). On a more practical side, I think that a must…
…1. Smith 和 Minton 著《微积分》第 4 版 2. Gilbert Strang 著《线性代数导论》 3. Hoel, Port, Stone 著《概率论导论》 4. Rosen 著《离散数学及其应用》 5. Hopcroft 著《自动机理论、语言和计算导论》 6. Cormen, Leiserson, Rivest, Stein 著《算法导论》在业余时间把这些全啃下来至少得花上一两年，但好处在于读完之后……
…Calculus 4th ed. by Smith and Minton 2. Introduction to Linear Algebra (Gilbert Strang) 3. Introduction to Probability Theory (Hoel, Port, Stone) 4. Discrete Mathematics and its applications (Rosen) 5. Introduction to Automata Theory, Languages, and Computation (Hopcroft) 6. Introduction to Algorithms (Cormen, Leiserson, Rivest, Stein) It will take you at least a year if not two to work through all these in your spare time, but the advantage is that after…
…重要性。* Michael Sipser 的《计算理论导论》。* 我也推荐 Christos Papadimitriou 的《计算理论基础》。* 另一个很好的补充是 Hopcroft 和 Ullman 的《自动机理论、语言和计算导论》。（感谢 @reacweb 的提醒。）* Reinhard Diestel 的《图论》。* 如果你想更深入，并且喜欢那种一个字都不舍得跳过的书，我…
…importance. * “Introduction to the Theory of Computation”, by Michael Sipser. * I also recommend the “Elements of the Theory of Computation”, by Christos Papadimitriou. * Another good complement is “Introduction to Automata Theory, Languages and Computation”, by Hopcroft and Ullman. (Thanks, @reacweb, for the reminder.) * “Graph Theory”, by Reinhard Diestel. * If you feel you want to go deeper, and like a book which you cannot skip a single word, I…