Mathematics

Algebraic theory of automata networks: an introduction by Pal Domosi, Chrystopher L. Nehaniv

By Pal Domosi, Chrystopher L. Nehaniv

Algebraic conception of Automata Networks investigates automata networks as algebraic constructions and develops their thought in response to different algebraic theories, similar to these of semigroups, teams, earrings, and fields. The authors additionally examine automata networks as items of automata, that's, as compositions of automata acquired via cascading with no suggestions or with suggestions of assorted limited varieties or, most widely, with the suggestions dependencies managed by means of an arbitrary directed graph. This self-contained ebook surveys and extends the basic leads to regard to automata networks, together with the most decomposition theorems of Letichevsky, of Krohn and Rhodes, and of others.

Algebraic idea of Automata Networks summarizes an important result of the prior 4 a long time relating to automata networks and provides many new effects found because the final publication in this topic used to be released. It comprises numerous new equipment and targeted strategies no longer mentioned in different books, together with characterization of homomorphically whole sessions of automata lower than the cascade product; items of automata with semi-Letichevsky criterion and with none Letichevsky standards; automata with keep an eye on phrases; primitive items and temporal items; community completeness for digraphs having all loop edges; entire finite automata community graphs with minimum variety of edges; and emulation of automata networks by way of corresponding asynchronous ones.

Show description

Read or Download Algebraic theory of automata networks: an introduction PDF

Similar mathematics books

Quantum Statistics in Optics and Solid-State Physics

Graham, Haake. Quantum data in Optics and Solid-state Physics(STMP66, Springer, 1976)(ISBN 0387061894)

Extra info for Algebraic theory of automata networks: an introduction

Sample text

Then h(y • (s1)) = h(y) • s1. Thus h(y 1 ) = h(y) • s1. Similarly, h ( y 1 . (s2)) = h(y 1 ) • s2 and thus h(y2) = h(y 1 ) • s2. Hence we get h(y2) = h(y) • s1s2. s 1 s 2 = h (y. (s1) (s2)) holds for every y Y. On the other hand, by our assumptions, h(y) • s1s2 = h(y • (s 1 s 2 )), y Y. Thus we obtain h(y • (s 1 ) (s 2 )) = h(y • (s 1 s 2 )). Hence we obtain (s1) (s2) = ^(s1s2)|y by the bijectivity of h. But then we assumed (s1) (s2)= (s1s2). Thus is a semigroup isomorphism of S onto (S). Put T = (S), 1 = -l, 2 = h.

1. Digraph Completeness 39 (2) Characterize all digraphs D = (V, E) for which the degree (\V\ — 1) symmetric group can be embedded isomorphically into G(D (l) ). (3) Characterize all digraphs D = (V, E) for which the degree (\V\ — 1) symmetric group can be embedded isomorphically into G(D). (4) Characterize all digraphs D = (V, E) for which the degree \V\ symmetric group can be embedded isomorphically into G(D (l) ). (5) Characterize all digraphs D = (V, E)for which the degree \ V \ symmetric group can be embedded isomorphically into G(D).

D has a homomorphism onto D' = (V', E') if E' = {( (v), (v')) | (v, v') E} for some surjective : V V. If is bijective, then we speak about an isomorphism. D is connected for v V if for every vertex v' V either v = v' or there is a (directed) path from v to v'. D is called strongly connected if it is connected for all of its vertices. Moreover, D is centralized if there exists a v V with (V \ {v}) x {v} E. An undirected graph = (V, E) is a set of vertices V (| V| > 0) and edges E {{v, v'} | v, v' V}.

Download PDF sample

Rated 4.14 of 5 – based on 15 votes