Algebraic Theory of Automata Networks: A Introduction - Couverture rigide

Dõmõsi, Pál; Nehaniv, Chrystopher L.

 
9780898715699: Algebraic Theory of Automata Networks: A Introduction
Couverture rigide
ISBN 10 : 0898715695 ISBN 13 : 9780898715699
Editeur : Society for Industrial and Applied Mathematics, 2004

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Revue de presse

'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

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Society for Industrial and Applied Mathematics
Date d'édition
2004
Langue
anglais
ISBN 10 
0898715695
ISBN 13 
9780898715699
Reliure
Relié
Nombre de pages
270
Coordonnées du fabricant
non disponible
Personne responsable
non disponible