The Community for Technology Leaders
Green Image
Abstract?Autonomous sequential networks are represented by transformation graphs, i.e., finite directed graphs, each vertex of which has outdegree one. A network that can be realized by a set of simpler, parallel networks corresponds to a transformation graph representable as a Cartesian product of simpler graphs. An algorithm for obtaining the various decompositions of a given transformation graph into irreducible factors is presented. The particular decomposition into a minimum number of factors is directly reached by the method. Decompositions into a greater number of factors are also obtained so that a balance may be struck between number and complexity of factors.
Index terms?Automata decompositions, autonomous sequential networks, network decomposition algorithm, parallel decomposition lgorithm, transformation graph, unary algebra.

M. Yoeli, J. Turner and C. Ablow, "Irreducible Decompositions of Transformation Graphs by Assignment Techniques," in IEEE Transactions on Computers, vol. 17, no. , pp. 325-329, 1968.
81 ms
(Ver 3.3 (11022016))