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.
"synopsis" may belong to another edition of this title.
'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
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.
"About this title" may belong to another edition of this title.
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. new title edition. 270 pages. 10.50x7.50x0.75 inches. In Stock. Seller Inventory # __0898715695
Quantity: 2 available
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condition: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0898715695I3N10
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. 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.It 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. Seller Inventory # LU-9780898715699
Quantity: 1 available
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. 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.It 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. Seller Inventory # LU-9780898715699
Quantity: 1 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Good. Good. Dust Jacket NOT present. CD WILL BE MISSING. . SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA82908987156956
Quantity: 1 available