This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and Godel's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.
具体描述
读后感
评分
评分
评分
评分
用户评价
formal language theory的课本，清晰度尚可，趣味性一般，和同时用的另外两门课本比，对这门学科的实际应用介绍不多，以计算理论为主，比较循序渐进，适合自学。
评分看起来略难
评分比theory of computation简单
评分弱弱的点个读过，看了大部分吧，但是都还给老师了。不要问我什么是 pumping lemma....
评分formal language theory的课本，清晰度尚可，趣味性一般，和同时用的另外两门课本比，对这门学科的实际应用介绍不多，以计算理论为主，比较循序渐进，适合自学。
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有