Automata Theory: An Algorithmic Approach (Hardcover)

A comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.

This textbook presents automata theory from a fresh viewpoint inspired by its main modern application, program verification, where automata are viewed as data structures for the algorithmic manipulation of sets and relations. This novel "automata as data structures" paradigm makes holistic connections between automata theory and other areas of computer science not covered in traditional texts, linking the study of algorithms and data structures with that of the theory of formal languages and computability. Esparza and Blondin provide incisive overviews of core concepts along with illustrated examples and exercises that facilitate quick comprehension of rigorous material.

• Uses novel "automata as data structures" approach
• Algorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verification
• The first introduction to automata on infinite words that does not assume prior knowledge of finite automata
• Suitable for both undergraduate and graduate students
• Thorough, engaging presentation of concepts balances description, examples, and theoretical results
• Extensive illustrations, exercises, and solutions deepen comprehension

一本全面介紹自動機理論的教材，採用將自動機視為資料結構的新穎方法。

這本教科書從一個新的觀點介紹自動機理論，靈感來自於其主要的現代應用領域——程式驗證，其中自動機被視為用於算法操作集合和關係的資料結構。這種新穎的「自動機作為資料結構」範式將自動機理論與傳統教材中未涵蓋的計算機科學其他領域進行了全面的聯繫，將算法和資料結構的研究與形式語言和可計算性理論相結合。Esparza和Blondin提供了核心概念的深入概述，並提供了豐富的示例和練習，有助於快速理解嚴謹的內容。

• 採用新穎的「自動機作為資料結構」方法


• 算法方法非常適合希望擴展技能的程式設計師和自動機理論和形式驗證領域的研究人員


• 首本介紹無限字自動機而不需要先備有限自動機知識的教材


• 適用於本科和研究生學生


• 全面而引人入勝的概念介紹平衡了描述、示例和理論結果


• 豐富的插圖、練習和解答加深了理解

Javier Esparza is Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich and coauthor of Free Choice Petri Nets and Unfoldings: A Partial-Order Approach to Model Checking.

Michael Blondin is Associate Professor of Computer Science at the Université de Sherbrooke.

Javier Esparza 是慕尼黑工業大學軟體可靠性基礎和理論計算機科學的教授和主席，並且是《自由選擇Petri網絡和展開：一種偏序方法的模型檢查》的合著者。

Michael Blondin 是舍布魯克大學計算機科學的副教授。