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 matrixbased 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.

关键词： Finite Automata Product Composition Parallel Composition Decomposition Semi-tensor Product

作者: ZHANG Yanqiong XU Xiangru HONG Yiguang

作者单位: Key Laboratory of Systems and Control, Academy of Mathematics and Systems ScienceChinese Academy of Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science Chinese Academy of

会议类型: 国际会议

会议名称: The 31st Chinese Control Conference(第三十一届中国控制会议)

会议地点: 合肥

会议语种:英文

页码: 2151-2156

在线出版日期: 2012-07-01（万方平台首次上网日期，不代表论文的发表时间）