| Description |
1 online resource (xxiv, 758 pages) : illustrations |
| Contents |
Preface to the English edition -- Preface -- Fundamental structures -- The simplest possible machine -- The power of algebra -- The pertinence of enumeration -- The richness of transducers -- The simplicity of functional transducers |
| Summary |
"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"--Book cover |
| Bibliography |
Includes bibliographical references (pages 739-748) and index |
| Notes |
English |
|
Print version record |
| Subject |
Machine theory.
|
|
MATHEMATICS -- Algebra -- Intermediate.
|
|
Machine theory
|
|
Automatentheorie
|
| Form |
Electronic book
|
| ISBN |
9781461951810 |
|
146195181X |
|
9781139195218 |
|
1139195212 |
|
1139638750 |
|
9781139638753 |
|
9781139641593 |
|
113964159X |
|
1139887025 |
|
9781139887021 |
|
1139635360 |
|
9781139635363 |
|
1139637215 |
|
9781139637213 |
|
1139649213 |
|
9781139649216 |
|
