图书标签: 计算理论 计算机科学 theory computational computation automate
发表于2024-11-22
Automata and Computability pdf epub mobi txt 电子书 下载 2024
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.
看起来略难
评分比theory of computation简单
评分弱弱的点个读过,看了大部分吧,但是都还给老师了。不要问我什么是 pumping lemma....
评分比theory of computation简单
评分弱弱的点个读过,看了大部分吧,但是都还给老师了。不要问我什么是 pumping lemma....
评分
评分
评分
评分
Automata and Computability pdf epub mobi txt 电子书 下载 2024