Generalized decomposition of incomplete finite automata

The problem of decomposing a finite automaton has been investigated by many authors [7,8,9,16]. However, their results were based on the question of decomposing an automaton into series and parallel connections of automata. The present work is an extension to the problem of generalized decomposition where two-way interconnections between automata are permitted. Our decomposition does not presuppose the logical design of the circuit of an automaton. With the new technology, the problem of economical realization no longer lies in the actual complexity of the logical design in each building block. Aside from a given upper limit, the complexity is not reflected in the cost. Subject to the restraint of the given limit on each block, the main object is to minimize the number of interconnections between blocks of a generalized decomposition of an automaton.