Elements of Automata Theory
Published on 1. October 2009
978-1-139-63287-4 (ISBN)
Description
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.
Reviews / Votes
'... 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 ReviewsMore details
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 15 Halftones, unspecified; 260 Line drawings, unspecified
File size
6,00 MB
ISBN-13
978-1-139-63287-4 (9781139632874)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Jacques Sakarovitch
Elements of Automata Theory
Book
10/2009
Cambridge University Press
€258.90
Shipment within 15-20 days
Persons
Jacques Sakarovitch is Directeur de recherche at the Centre National de la Recherche Scientifique (CNRS), Paris.
Content
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.
