Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition

This paper investigates the transition function and the reachability conditions of finite automata by using a semi-tensor product of matrices, which is a new powerful matrix analysis tool. The states and input symbols are first expressed in vector forms, then the transition function is described in an algebraic form. Using this algebraic representation, a sufficient and necessary condition of the reachability of any two states is proposed, based on which an algorithm is developed for discovering all the paths from one state to another. Furthermore, a mechanism is established to recognize the language acceptable by a finite automaton. Finally, illustrative examples show that the results/algorithms presented in this paper are suitable for both deterministic finite automata (DFA) and nondeterministic finite automata (NFA).

[1]  Sherif Abdelwahed,et al.  Blocking detection in discrete event systems , 2003, Proceedings of the 2003 American Control Conference, 2003..

[2]  Daizhan Cheng,et al.  Input-state incidence matrix of Boolean control networks and its applications , 2010, Syst. Control. Lett..

[3]  Peng Cui,et al.  Singular Boolean networks: Semi-tensor product approach , 2012, Science China Information Sciences.

[4]  Darrell D. E. Long,et al.  Theory of finite automata with an introduction to formal languages , 1989 .

[5]  John Lygeros,et al.  Controllers for reachability specifications for hybrid systems , 1999, Autom..

[6]  T. Villa,et al.  Improving reachability analysis of hybrid automata for engine control , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[7]  Yiguang Hong,et al.  Matrix expression and reachability analysis of finite automata , 2012 .

[8]  Cheng Daizhan.  Semi-tensor product of matrices and its application to Morgen’s problem , 2001 .

[9]  Ki Hang Kim.  Boolean matrix theory and applications , 1982 .

[10]  Yuzhen Wang,et al.  A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems , 2012, Autom..

[11]  Michael Margaliot,et al.  Symbolic dynamics of Boolean control networks , 2013, Autom..

[12]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[13]  Zengqiang Chen,et al.  Solving type-2 fuzzy relation equations via semi-tensor product of matrices , 2014, Control Theory and Technology.

[14]  Fangfei Li,et al.  Complete synchronization of temporal Boolean networks , 2013, Neural Networks.

[15]  Tianguang Chu,et al.  Synchronization Design of Boolean Networks Via the Semi-Tensor Product Method , 2013, IEEE Transactions on Neural Networks and Learning Systems.

[16]  Zuohua Ding,et al.  Hybrid MARTE statecharts , 2012, Frontiers of Computer Science.

[17]  Yuzhen Wang,et al.  Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method , 2012, Autom..

[18]  Witold Charatonik,et al.  Parameterized complexity of basic decision problems for tree automata , 2013, Int. J. Comput. Math..

[19]  D Voss,et al.  Frontiers of computer science. , 1991, Science.

[20]  G. Metze,et al.  Transition Matrices of Sequential Machines , 1959 .

[21]  Umit Ozguner,et al.  Controllability, reachability, stabilizability and state reduction in automata , 1992, Proceedings of the 1992 IEEE International Symposium on Intelligent Control.

[22]  Kuize Zhang,et al.  L2 stability, H∞ control of switched homogeneous nonlinear systems and their semi‐tensor product of matrices representation , 2013 .

[23]  Yiguang Hong,et al.  Matrix approach to simulation and bisimulation analysis of finite automata , 2012, Proceedings of the 10th World Congress on Intelligent Control and Automation.

[24]  Haitao Li,et al.  A Semi‐Tensor Product Approach to Pseudo‐Boolean Functions with Application to Boolean Control Networks , 2014 .

[25]  Huan Long,et al.  A general approach for building combinational P automata , 2007, Int. J. Comput. Math..

[26]  Yuzhen Wang,et al.  Output feedback stabilization control design for Boolean control networks , 2013, Autom..

[27]  Daizhan Cheng,et al.  Semi-tensor product of matrices and its application to Morgen’s problem , 2007, Science in China Series : Information Sciences.

[28]  Fangfei Li,et al.  Controllability and optimal control of a temporal Boolean network , 2012, Neural Networks.

[29]  D. Cheng,et al.  An Introduction to Semi-Tensor Product of Matrices and Its Applications , 2012 .

[30]  Thomas Sudkamp,et al.  Languages and Machines , 1988 .

[31]  Zengqi Sun,et al.  Biped walking on level ground with torso using only one actuator , 2013, Science China Information Sciences.