- Home
- Computers
- Programming
- Automata Theory (An Algorithmic Approach)
Automata Theory (An Algorithmic Approach)
List Price:
$80.00
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Javier Esparza, Michael Blondin
Format:
Hardcover
Pages:
560
Publisher:
MIT Press (October 17, 2023)
Language:
English
ISBN-13:
9780262048637
ISBN-10:
0262048639
Weight:
41oz
Dimensions:
7.31" x 9.31" x 1.46"
File:
RandomHouse-PRH_Book_Company_PRH_PRT_Onix_full_active_D20260405T162951_155746725-20260405.xml
Folder:
RandomHouse
List Price:
$80.00
Case Pack:
10
As low as:
$61.60
Publisher Identifier:
P-RH
Discount Code:
A
QuickShip:
Yes
Audience:
General/trade
Country of Origin:
United States
Pub Discount:
65
Imprint:
The MIT Press
Overview
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.
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
