Recommended product

Popular links

Popular links


Elements of Automata Theory

Elements of Automata Theory

Elements of Automata Theory

Jacques Sakarovitch , Centre National de la Recherche Scientifique (CNRS), Paris
Reuben Thomas
October 2009
Available
Hardback
9780521844253

Looking for an inspection copy?

This title is not currently available for inspection.

£192.00
GBP
Hardback
USD
eBook

    Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book.

    • Goes beyond the elementary results presented in other books on the subject
    • Provides full proofs for all required elementary results in linear algebra
    • Contains over 500 exercises and solutions

    Reviews & endorsements

    '… a rich exposition … expertly translated by Reuben Thomas … its motivating ideas and substantive cross-currents fill almost every page … Nothing seems to be missing … should be on the shelf of every serious student and professional. It will enjoy a very long stay on my own.' Computing Reviews

    See more reviews

    Product details

    No date available
    Adobe eBook Reader
    9781139632874
    0 pages
    0kg
    275 b/w illus. 520 exercises
    This ISBN is for an eBook version which is distributed on our behalf by a third party.

    Table of Contents

    • Foreword
    • 0. Fundamental structures
    • 1. The simplest possible machine
    • 2. The power of algebra
    • 3. The pertinence of enumeration
    • 4. The richness of transducers
    • 5. The simplicity of functional transducers
    • Bibliography
    • Index.
      Author
    • Jacques Sakarovitch , Télécom ParisTech, Ecole Nationale Supérieure des Télécommunications

      Jacques Sakarovitch is Directeur de recherche at the Centre National de la Recherche Scientifique (CNRS), Paris.

    • Translator
    • Reuben Thomas