    1. Algebra 2. Abstract Automata 3. Abstract Network 4. Partition Pairs and Pair Algebra 5. Construction of an Abstract Network       5.1. Drawing       5.2. Construction       5.3. Example       5.4. Applet on the Construction of an Abstract Network 6. Structured Network 7. Additive Decomposition

5. CONSTRUCTION OF AN ABSTRACT NETWORK

5.1. Drawing of an automata network N As we can see from the image above, a network is defined by component automata , connections between them and an output function.

A component automaton is characterized by three partitions: (   ) - a characteristic triple.  ) is an S-S pair and (  ) is an I-S pair.

5.2. Construction of an abstract network

We construct the network by the following steps:

1. we define the states of a component automaton

2. Then we define which other component automata it depends on The structure matrix clearly demonstrates the connections between component automata 3. define internal and external input alphabets

4. 5. define the transition function

6.  7. define the internal input restriction function

8. 9. define the external input restriction function

10. 11. define the output function

12. Example Last update: 3 August, 2004