Descripción del título
Algebraic theory of automat...
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. They survey and extend the fundamental results in regard to automata networks, including the main decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others
Monografía
monografia Rebiun36906040 https://catalogo.rebiun.org/rebiun/record/Rebiun36906040 m eo d cr bn |||m|||a 101020s2005 paua ob 001 0 eng d 2004057838 0-89871-849-X DT11 siam DT11 SIAM CUNEF 991000509055108131 CaBNVSL. CaBNVSL. CaBNVSL eng 004.6 22 DoÌmoÌsi, PaÌl Algebraic theory of automata networks an introduction PaÌl DoÌmoÌsi, Chrystopher L. Nehaniv Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 2005 Philadelphia, Pa. Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1 electronic text (xii, 258 p. : ill.) digital file 1 electronic text (xii, 258 p. : ill.) Text txt computer c online resource cr SIAM monographs on discrete mathematics and applications Bibliographic Level Mode of Issuance: Monograph Includes bibliographical references (p. 237-252) and index Preliminaries -- Directed Graphs, Automata, and Automata Networks -- Krohn-Rhodes Theory and Complete Classes -- Without Letichevsky's Criterion -- Letichevsky's Criterion -- Primitive Products and Temporal Products -- Finite State-Homogeneous Automata Networks and Asynchronous 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. They survey and extend the fundamental results in regard to automata networks, including the main decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others Also available in print version Mode of access: World Wide Web System requirements: Adobe Acrobat Reader English Computer networks Machine theory Semigroups Algebra, Abstract Nehaniv, Chrystopher L. 1963-) Society for Industrial and Applied Mathematics 0-89871-569-5 SIAM monographs on discrete mathematics and applications