Automata and Computability 在线电子书 图书标签: 计算理论 计算机科学 theory computational computation automate
发表于2024-11-26
Automata and Computability 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024
比theory of computation简单
评分比theory of computation简单
评分看起来略难
评分formal language theory的课本,清晰度尚可,趣味性一般,和同时用的另外两门课本比,对这门学科的实际应用介绍不多,以计算理论为主,比较循序渐进,适合自学。
评分看起来略难
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.
评分
评分
评分
评分
Automata and Computability 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024