• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • 'Language is english. Váltás magyarra.'
    Wishlist
    Theory of Computation for Software Developers

    Theory of Computation for Software Developers by Mozgovoy, Maxim;

      • GET 20% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice GBP 96.00
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        43 344 Ft (41 280 Ft + 5% VAT)
      • Discount 20% (cc. 8 669 Ft off)
      • Discounted price 34 675 Ft (33 024 Ft + 5% VAT)
      • Discount is valid until: 30 June 2026

    39 010 Ft

    db

    Availability

    Not yet published.

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Edition number 1
    • Publisher Chapman and Hall
    • Date of Publication 30 July 2026

    • ISBN 9781032614809
    • Binding Paperback
    • No. of pages244 pages
    • Size 234x156 mm
    • Weight 453 g
    • Language English
    • Illustrations 94 Illustrations, black & white; 94 Line drawings, black & white
    • 700

    Categories

    Short description:

    The theory of computation is often viewed as one of the most abstract areas of computer science, mostly reserved for university courses. This book aims to bridge the gap between the formal world of the theory of computation and the realities of everyday programming practice.

    More

    Long description:

    The theory of computation is often viewed as one of the most abstract areas of computer science, mostly reserved for university courses. Yet its ideas power much of modern software: from regular expressions and compilers to animation systems and game AI. This book aims to bridge the gap between the formal world of the theory of computation and the realities of everyday programming practice.


    Written in a clear, approachable style, it introduces the essential concepts of automata, formal languages, and computability. Through examples and practical connections, readers will see how theoretical models translate into the tools and systems developers work with every day. The book is designed for both students, taking basic computer science courses, and practicing developers who want to understand the theory behind the technologies they use but are not ready to dive into a fully formal academic text.


    Covering material aligned with the ACM/IEEE Computer Science Curricula, this book can serve both as a gentle textbook and a self-contained crash course for curious professionals. Striking a balance between rigor and intuition, it presents the theory of computation as a practical foundation of how software and computation really work.


    Maxim Mozgovoy is a senior associate professor at the University of Aizu, Japan. He earned his PhD in Applied Mathematics from St. Petersburg State University and his PhD in Computer Science from the University of Joensuu. His main research interests are focused on educational technologies, natural language processing, and artificial intelligence for games and interactive environments. Maxim has a record of over 100 published papers and industrial-level software development experience. He is a co-founder of Helium9 Games studio, a regular reviewer for IEEE Transactions on Games and Entertainment Computing, and a program committee member of the IEEE Conference on Games, FedCSIS, Foundations of Digital Games, and other international conferences.

    More

    Table of Contents:

    Chapter 1 Regular languages and regular expressions


    Chapter 2 Finite automata


    Chapter 3 Bridging regular expressions and finite automata


    Chapter 4 State machines in software engineering


    Chapter 5 Nonregular languages and context-free grammars


    Chapter 6 Pushdown automata


    Chapter 7 Parsing


    Chapter 8 Building compilers


    Chapter 9 The Lindenmayer systems


    Chapter 10 Turing machines


    Chapter 11 Decidability and complexity

    More
    0