Skip to content

Elements of Automata Theory

ISBN-10: 0521844258

ISBN-13: 9780521844253

Edition: 2009

Authors: Jacques Sakarovitch, Reuben Thomas

List price: $199.00
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

Automata theory lies at the foundation of computer science, and is essential to a theoretical understanding of how computers work and what constitutes formal methods. This treatise on finite automata theory aims to give on the one hand a rigorous and account of the subject and on the other sheds light on what actually constitutes it 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 are included in the book.
Customers also bought

Book details

List price: $199.00
Copyright year: 2009
Publisher: Cambridge University Press
Publication date: 10/1/2009
Binding: Hardcover
Pages: 782
Size: 7.50" wide x 9.50" long x 1.50" tall
Weight: 3.586

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. References; Index.