Algebraic Theory of Automata Networks
A Introduction

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.

Reviews & endorsements

'This self-contained monograph covers the foundations of what is currently known about automata networks, giving the reader sufficient theoretical background to be at the forefront of research in many related areas.' Alexandra Kireeva, Mathematical Reviews

Customer reviews

Product details

• Date Published: December 2004
• format: Hardback
• isbn: 9780898715699
• length: 270 pages

• dimensions: 260 x 183 x 17 mm
• weight: 0.669kg
• availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial null Mathematics for availability.