Elements of Automata Theory
Seiten
2009
Cambridge University Press (Verlag)
978-0-521-84425-3 (ISBN)
Cambridge University Press (Verlag)
978-0-521-84425-3 (ISBN)
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.
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.
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.
Jacques Sakarovitch is Directeur de recherche at the Centre National de la Recherche Scientifique (CNRS), Paris.
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.
| Erscheint lt. Verlag | 1.10.2009 |
|---|---|
| Übersetzer | Reuben Thomas |
| Zusatzinfo | Worked examples or Exercises; 15 Halftones, unspecified; 260 Line drawings, unspecified |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 195 x 253 mm |
| Gewicht | 1630 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
| ISBN-10 | 0-521-84425-8 / 0521844258 |
| ISBN-13 | 978-0-521-84425-3 / 9780521844253 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
