{"product_id":"algebraic-theory-of-automata-networks-an-introduction-a-introduction-hardback-9780898715699","title":"Algebraic Theory of Automata Networks – An Introduction; A Introduction (Hardback) 9780898715699","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eAlgebraic Theory of Automata Networks – An Introduction\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eA Introduction\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eThis book investigates automata networks as algebraic structures and develops their theory in line with other algebraic theories.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003ePál Dömösi (Author), Chrystopher L. Nehaniv (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780898715699\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 31 December 2004\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e270 pages\u003cbr\u003e26 x 18.4 x 1.6 cm, 0.666 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'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\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eAlgebraic 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface and overview\u003cbr\u003e 1. Preliminaries\u003cbr\u003e 2. Directed graphs, automata, and automata networks\u003cbr\u003e 3. Krohn-Rhodes theory and complete classes\u003cbr\u003e 4. Without Letichevsky's criterion\u003cbr\u003e 5. Letichevsky's criterion\u003cbr\u003e 6. Primitive products and temporal products\u003cbr\u003e 7. Finite state-homogeneous automata networks and asynchronous automata networks\u003cbr\u003e Bibliography\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Miscellaneous items [\u003ca title=\"See our other books on Miscellaneous items\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Miscellaneous%20items%20%5BWZ%5D%22\"\u003eWZ\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"MP–SIA SIAM – Society for Industrial and Applied M","offers":[{"title":"Brand New","offer_id":52410747191576,"sku":"9780898715699","price":92.78,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9780898715699i.jpg?v=1784251372","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/algebraic-theory-of-automata-networks-an-introduction-a-introduction-hardback-9780898715699","provider":"Freshly Printed Books","version":"1.0","type":"link"}