Pál Dömösi and Chrystopher L. Nehaniv
SIAM Monographs on Discrete Mathematics and Applications 11
Algebraic Theory of Automata Networks investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories, such as those of semigroups, groups, rings, and fields. The authors also investigate automata networks as products of automata, that is, as compositions of automata obtained by cascading without feedback or with feedback of various restricted types or, most generally, with the feedback dependencies controlled by an arbitrary directed graph. This self-contained book surveys and extends the fundamental results in regard to automata networks, including the main decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others.
Algebraic Theory of Automata Networks 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. It contains several new methods and special techniques not discussed in other books, 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.
This book provides graduate students and newcomers to the field with ideas, methods, and results of algebraic theory of automata networks. Researchers and engineers working in the area may find the book useful as well, especially chapters about Krohn–Rhodes theory, primitive products, and temporal products, as well as general and various special types of automata networks.
Preface and Overview; Chapter 1: Preliminaries; Chapter 2: Directed Graphs, Automata, and Automata Networks; Chapter 3: Krohn–Rhodes Theory and Complete Classes; Chapter 4: Without Letichevsky’s Criterion; Chapter 5: Letichevsky’s Criterion; Chapter 6: Primitive Products and Temporal Products;
Chapter 7: Finite State-Homogeneous Automata Networks and Asynchronous Automata Networks; Bibliography; Index.
2004 | xii + 258 pages | Hardcover | ISBN-13: 978-0-898715-69-9 / ISBN-10: 0-89871-569-5 /
List Price $124.50 | SIAM Member Price $87.15 | Order Code DT11