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的課本，清晰度尚可，趣味性一般，和同時用的另外兩門課本比，對這門學科的實際應用介紹不多，以計算理論為主，比較循序漸進，適閤自學。
评分看起來略難
评分看起來略難
评分弱弱的點個讀過，看瞭大部分吧，但是都還給老師瞭。不要問我什麼是 pumping lemma....
相關圖書
本站所有內容均為互聯網搜索引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有