Bi-decomposition analysis and algorithm of automata based on semi-tensor product

In this paper, we study the bi-decomposition of automata in two standard ways. With semi-tensor product, the matrix-based expression of automata is given and then the decomposition procedure is realized by the matrix calculation. Necessary and sufficient conditions for both product and parallel decomposability of deterministic finite automata are provided and examples are also given for illustration.