Description

Book Synopsis
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 

Automata Theory

    Product form

    £72.20

    Includes FREE delivery

    RRP £76.00 – you save £3.80 (5%)

    Order before 4pm today for delivery by Mon 13 Jul 2026.

    A Hardback by Javier Esparza, Michael Blondin

    10 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Automata Theory by Javier Esparza

      Publisher: MIT Press Ltd
      Publication Date: 10/17/2023 12:00:00 AM
      ISBN13: 9780262048637, 978-0262048637
      ISBN10: 0262048639
      Also in:
      Computer programming / software engineering

      Description

      Book Synopsis
      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 

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account