In this paper, we propose a matrix-based approach for finite automata and then study the reachability conditions. Both the deterministic and nondeterministic automata are expressed in matrix forms, and the necessary and sufficient conditions on reachability are given using semitensor product of matrices. Our results show that the matrix expression provides an effective computational way for the reachability analysis of finite automata.
Xiangru XU, Yiguang HONG Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China
