{"product_id":"automata-theory-isbn-9780262048637","title":"Automata Theory","description":"\u003cb\u003eA comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003eThis 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. \u003cbr\u003e\u003cbr\u003e\u003cul\u003e\n\u003cli\u003eUses novel “automata as data structures” approach\u003c\/li\u003e\n\u003cli\u003eAlgorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verification\u003c\/li\u003e\n\u003cli\u003eThe first introduction to automata on infinite words that does not assume prior knowledge of finite automata \u003c\/li\u003e\n\u003cli\u003eSuitable for both undergraduate and graduate students\u003c\/li\u003e\n\u003cli\u003eThorough, engaging presentation of concepts balances description, examples, and theoretical results \u003c\/li\u003e\n\u003cli\u003eExtensive illustrations, exercises, and solutions deepen comprehension \u003c\/li\u003e\n\u003c\/ul\u003ePreface xiii\u003cbr\u003e0 Overview 1\u003cbr\u003eI Automata on Finite Words \u003cbr\u003e1 Automata Classes and Conversions 9\u003cbr\u003e2 Minimization and Reduction 49\u003cbr\u003e3 Operations on Sets: Implementations 75\u003cbr\u003e4 Application 1: Pattern Matching 101\u003cbr\u003e5 Operations on Relations: Implementations 113\u003cbr\u003e6 Finite Universes and Decision Diagrams 131\u003cbr\u003e7 Application II: Verification 163\u003cbr\u003e8 Automata and Logic 193\u003cbr\u003e9 Application III: Presburger Arithmetic 229\u003cbr\u003eII Automata on Infinite Words\u003cbr\u003e10 Classes of Automata and Conversions 247\u003cbr\u003e11 Boolean Operations: Implementations 289\u003cbr\u003e12 Emptiness Check: Implementations 313\u003cbr\u003e13 Application I: Verification and Temporal Logic 341\u003cbr\u003e14 Application II: MSO Logics on Words and Linear Arithmetic 365\u003cbr\u003eSolutions 377\u003cbr\u003eBibliographic Notes 523\u003cbr\u003eBibliography 531\u003cbr\u003eIndex 539\u003cb\u003eJavier Esparza \u003c\/b\u003eis Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich and coauthor of \u003cu\u003eFree Choice Petri Nets\u003c\/u\u003e and \u003cu\u003eUnfoldings: A Partial-Order Approach to Model Checking.\u003c\/u\u003e\u003cbr\u003e\u003cbr\u003e\u003cb\u003eMichael Blondin\u003c\/b\u003e is Associate Professor of Computer Science at the Université de Sherbrooke.","brand":"The MIT Press","offers":[{"title":"Default Title","offer_id":46304455164133,"sku":"NP9780262048637","price":80.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9780262048637.jpg?v=1767721977","url":"https:\/\/k12savings.com\/products\/automata-theory-isbn-9780262048637","provider":"K12savings","version":"1.0","type":"link"}