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

DOI10.1007/s11704-014-3425-yzbMath1403.68131OpenAlexW2072471271MaRDI QIDQ1633055

Zhongxin Liu, Zeng-Qiang Chen, Yongyi Yan

Publication date: 19 December 2018

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-014-3425-y

zbMATH Keywords

finite automatareachability analysissemi-tensor productmatrix approachtransition function expression

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items

Algebraic state space approach to model and control combined automata, An adjoint network approach to design stabilizable switching signals of switched Boolean networks, Set reachability and observability of probabilistic Boolean networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
• Complete synchronization of temporal Boolean networks
• Input-state incidence matrix of Boolean control networks and its applications
• Semi-tensor product of matrices and its application to Morgen's problem
• Controllers for reachability specifications for hybrid systems
• Controllability and optimal control of a temporal Boolean network
• Output feedback stabilization control design for Boolean control networks
• Symbolic dynamics of Boolean control networks
• Parameterized complexity of basic decision problems for tree automata
• L₂stability,H_∞control of switched homogeneous nonlinear systems and their semi-tensor product of matrices representation
• Singular Boolean networks: Semi-tensor product approach
• A general approach for building combinationalPautomata
• Solving type-2 fuzzy relation equations via semi-tensor product of matrices