This specific ISBN edition is currently not available.View all copies of this ISBN edition:
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.
"synopsis" may belong to another edition of this title.
A treatise on finite automata theory that both gives a rigorous account and illuminates its real meaning. The first part is organised around notions of rationality and recognisability. The second deals with relations between words realised by finite automata. Many exercises, often with solutions or answers, are included.About the Author:
Jacques Sakarovitch is Directeur de recherche at the Centre National de la Recherche Scientifique (CNRS), Paris.
"About this title" may belong to another edition of this title.
(No Available Copies)
If you know the book but cannot find it on AbeBooks, we can automatically search for it on your behalf as new inventory is added. If it is added to AbeBooks by one of our member booksellers, we will notify you!Create a Want