This book investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories.
"Sinopsis" puede pertenecer a otra edición de este libro.
'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
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FW-9780898715699
Cantidad disponible: 2 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 5158701-n
Cantidad disponible: 2 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. new title edition. 270 pages. 10.50x7.50x0.75 inches. In Stock. Nº de ref. del artículo: __0898715695
Cantidad disponible: 2 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 5158701-n
Cantidad disponible: 2 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. 2004. hardcover. . . . . . Nº de ref. del artículo: V9780898715699
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 5158701
Cantidad disponible: 2 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Hardback. Condición: 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. Nº de ref. del artículo: LU-9780898715699
Cantidad disponible: 1 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. New copy - Usually dispatched within 4 working days. Nº de ref. del artículo: B9780898715699
Cantidad disponible: 2 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. 2004. hardcover. . . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9780898715699
Cantidad disponible: 1 disponibles
Librería: Rarewaves.com UK, London, Reino Unido
Hardback. Condición: 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. Nº de ref. del artículo: LU-9780898715699
Cantidad disponible: 1 disponibles