| Popis: |
Publisher Summary This chapter focuses on isomorphic networks. It focuses on two networks: for the first network, the structural formula is y¯;X U xY and its recurrence equations are xN+1 = y¯;N, yN+1 = xN. Starting from the initial position, x0 = 0, y0 = 0, an evolution is got such that x1 = 1, y1 = 0; xII = 1, yII = 1; xIII = 0, yIII = 1. Two evolutions are isomorphic if the two operating programs of the lamps are identical, except, possibly, their notation; in other words, the two evolutions are isomorphic if there is a permutation of the characteristic lamps. The classification of autonomous networks with one relay is also described in the chapter. |
