Automata Theory: An Algorithmic Approach by Javier Esparza, Michael Blondin

haimk
(307)
Seller's other items
Contact seller
US $39.00
ApproximatelyRM 164.92
or Best Offer
Condition:
Like New
Shipping:
US $5.97 (approx RM 25.25) USPS Media MailTM.
Located in: Millington, New Jersey, United States
Delivery:
Estimated between Wed, 22 Oct and Wed, 29 Oct to 94104
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
No returns accepted.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:196397049082

Item specifics

Condition
Like New: A book in excellent condition. Cover is shiny and undamaged, and the dust jacket is ...
Publication Date
2023-10-17
Book Title
Automata Theory: An Algorithmic Approach
Subject
Computer Science
ISBN
9780262048637
Category

About this product

Product Identifiers

Publisher
MIT Press
ISBN-10
0262048639
ISBN-13
9780262048637
eBay Product ID (ePID)
19058808931

Product Key Features

Number of Pages
560 Pages
Language
English
Publication Name
Automata Theory : an Algorithmic Approach
Subject
Programming / Algorithms, Software Development & Engineering / General, Computer Science
Publication Year
2023
Type
Textbook
Author
Javier Esparza, Michael Blondin
Subject Area
Computers
Format
Hardcover

Dimensions

Item Height
1.5 in
Item Weight
41.1 Oz
Item Length
9.3 in
Item Width
7.3 in

Additional Product Features

Intended Audience
Trade
LCCN
2022-052126
Illustrated
Yes
Table Of Content
Preface xiii 0 Overview 1 I Automata on Finite Words 1 Automata Classes and Conversions 9 2 Minimization and Reduction 49 3 Operations on Sets: Implementations 75 4 Application 1: Pattern Matching 101 5 Operations on Relations: Implementations 113 6 Finite Universes and Decision Diagrams 131 7 Application II: Verification 163 8 Automata and Logic 193 9 Application III: Presburger Arithmetic 229 II Automata on Infinite Words 10 Classes of Automata and Conversions 247 11 Boolean Operations: Implementations 289 12 Emptiness Check: Implementations 313 13 Application I: Verification and Temporal Logic 341 14 Application II: MSO Logics on Words and Linear Arithmetic 365 Solutions 377 Bibliographic Notes 523 Bibliography 531 Index 539
Synopsis
This comprehensive 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. The novel "automatea as data structures" paradigm makes holistic connection 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 language and computability. The first introduction to automata on infinite words that docs not assume prior knowledge of finite automata, Incisive overviews of core concepts balance description, examples, and theoretical results, Features extensive illustrations, exercises, and solutions, Algorithm approach ideal for programmers and researchers, Suitable for undergraduate and graduate students, 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
LC Classification Number
QA267.E87 2023

Item description from the seller

About this seller

haimk

100% positive feedback•16 items sold

Joined Nov 2001
Seller's other itemsContact

Seller feedback (6)

All ratingsselected
Positive
Neutral
Negative
  • a***5 (1363)- Feedback left by buyer.
    Past year
    Verified purchase
    Book as described
    Maya Plisetskaya Майя Плисецкая Тринадцать лет спустя - Сердитые заметки HC Rus (#196413425216)
  • eBay automated Feedback- Feedback left by buyer.
    Past month
    Order delivered on time with no issues
    Золотой Храм. (#197113290666)
  • eBay automated Feedback- Feedback left by buyer.
    Past 6 months
    Order delivered on time with no issues
    Connecting Discrete Mathematics and Computer Science by David Liben-Nowell: Used (#197291339713)
See all feedback

More to explore :