Algebraic Theory of Automata Networks
A Introduction
Seiten
2004
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-569-9 (ISBN)
Society for Industrial & Applied Mathematics,U.S. (Verlag)
978-0-89871-569-9 (ISBN)
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories. The text summarizes the most important results of the past four decades regarding automata networks and presents new results discovered since the last book on this subject was published.
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories. Automata networks are investigated as products of automata, and the fundamental results in regard to automata networks are surveyed and extended, including the main decomposition theorems of Letichevsky, and of Krohn and Rhodes. The text summarizes the most important results of the past four decades regarding automata networks and presents many new results discovered since the last book on this subject was published. Several new methods and special techniques are discussed, including characterization of homomorphically complete classes of automata under the cascade product; products of automata with semi-Letichevsky criterion and without any Letichevsky criteria; automata with control words; primitive products and temporal products; network completeness for digraphs having all loop edges; complete finite automata network graphs with minimal number of edges; and emulation of automata networks by corresponding asynchronous ones.
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories. Automata networks are investigated as products of automata, and the fundamental results in regard to automata networks are surveyed and extended, including the main decomposition theorems of Letichevsky, and of Krohn and Rhodes. The text summarizes the most important results of the past four decades regarding automata networks and presents many new results discovered since the last book on this subject was published. Several new methods and special techniques are discussed, including characterization of homomorphically complete classes of automata under the cascade product; products of automata with semi-Letichevsky criterion and without any Letichevsky criteria; automata with control words; primitive products and temporal products; network completeness for digraphs having all loop edges; complete finite automata network graphs with minimal number of edges; and emulation of automata networks by corresponding asynchronous ones.
Preface and overview; 1. Preliminaries; 2. Directed graphs, automata, and automata networks; 3. Krohn-Rhodes theory and complete classes; 4. Without Letichevsky's criterion; 5. Letichevsky's criterion; 6. Primitive products and temporal products; 7. Finite state-homogeneous automata networks and asynchronous automata networks; Bibliography; Index.
| Reihe/Serie | Monographs on Discrete Mathematics and Applications |
|---|---|
| Verlagsort | New York |
| Sprache | englisch |
| Maße | 183 x 260 mm |
| Gewicht | 669 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Algebra |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| ISBN-10 | 0-89871-569-5 / 0898715695 |
| ISBN-13 | 978-0-89871-569-9 / 9780898715699 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2022)
Springer Spektrum (Verlag)
CHF 55,95
