Formal Languages and Computation: Models and Their Applications (Hardcover)
暫譯: 形式語言與計算:模型及其應用(精裝版)
Alexander Meduna
- 出版商: Auerbach Publication
- 出版日期: 2014-02-11
- 售價: $3,200
- 貴賓價: 9.5 折 $3,040
- 語言: 英文
- 頁數: 315
- 裝訂: Hardcover
- ISBN: 1466513454
- ISBN-13: 9781466513457
-
其他版本:
Formal Languages and Computation: Models and Their Applications
立即出貨 (庫存=1)
買這商品的人也買了...
-
$2,220$2,109 -
$1,460$1,387 -
$2,010$1,910 -
$480$374 -
$450$315 -
$1,930$1,834 -
$1,270$1,207 -
$420$332 -
$720$706 -
$390$308 -
$560$442 -
$650$585 -
$454Java 高並發編程詳解:多線程與架構設計
-
$2,470Programming Bitcoin
-
$520$411 -
$650$553 -
$620$490 -
$2,100$1,995 -
$580$458 -
$1,750$1,663 -
$550$495 -
$480$480 -
$607Go 語言高級開發與實戰
-
$414$393 -
$520$411
商品描述
Formal Languages and Computation: Models and Their Applications gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. Emphasizing the relationship between theory and application, the book describes many real-world applications, including computer science engineering techniques for language processing and their implementation.
- Covers the theory of formal languages and their models, including all essential concepts and properties
- Explains how language models underlie language processors
- Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models—regular expressions, finite automata, context-free grammars, and pushdown automata
- Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure
- Reviews the general theory of computation, particularly computability and decidability
- Considers problem-deciding algorithms in terms of their computational complexity measured according to time and space requirements
- Points out that some problems are decidable in principle, but they are, in fact, intractable problems for absurdly high computational requirements of the algorithms that decide them
In short, this book represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigors to make all results quite clear and valid. Every complicated mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. After studying this book, both student and professional should be able to understand the fundamental theory of formal languages and computation, write language processors, and confidently follow most advanced books on the subject.
商品描述(中文翻譯)
《形式語言與計算:模型及其應用》清晰且全面地介紹了形式語言理論及其在計算機科學中的應用。它涵蓋了所有與形式語言及其模型相關的基本主題,特別是文法和自動機,並概述了計算理論的基本概念,包括可計算性、可決定性和計算複雜性。該書強調理論與應用之間的關係,描述了許多現實世界的應用,包括計算機科學工程技術在語言處理中的應用及其實現。
- 涵蓋形式語言理論及其模型,包括所有基本概念和特性
- 解釋語言模型如何支撐語言處理器
- 特別關注基於四種語言模型的程式語言分析器,如掃描器和解析器——正則表達式、有限自動機、上下文無關文法和下推自動機
- 討論圖靈機的數學概念,作為直觀程序概念的普遍接受形式化
- 回顧一般的計算理論,特別是可計算性和可決定性
- 從其根據時間和空間需求測量的計算複雜性考慮問題決策算法
- 指出某些問題在原則上是可決定的,但實際上對於決定它們的算法而言,卻是難以處理的問題,因為其計算需求過於高昂
簡而言之,本書代表了一種以理論為導向的形式語言及其模型的處理,並專注於其應用。它介紹了所有相關的形式化,並以足夠的嚴謹性使所有結果清晰且有效。每一段複雜的數學內容都會有直觀的解釋,讓即使是書中最複雜的部分也易於理解。學習完本書後,學生和專業人士應能理解形式語言和計算的基本理論,編寫語言處理器,並自信地跟隨大多數進階的相關書籍。