Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
type: Item
instance of: scholarly article
title: Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
zbMATH Open document ID: 1403.68131
author: Y. Y. Yan
author: Zengqiang Chen
author: Zhongxin Liu
published in: Frontiers of Computer Science
publication date: 2018-12-19T00:00:00Z
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 6995605
zbMATH Keywords: finite automata
zbMATH Keywords: reachability analysis
zbMATH Keywords: transition function expression
zbMATH Keywords: matrix approach
zbMATH Keywords: semi-tensor product
MaRDI profile type: Publication
full work available at URL: s11704-014-3425-y
OpenAlex ID: W2072471271
cites work: Semi-tensor product of matrices and its application to Morgen's problem
cites work: Q3224871
cites work: Symbolic dynamics of Boolean control networks
cites work: \(L_{2}\) stability, \(H_{\infty }\) control of switched homogeneous nonlinear systems and their semi-tensor product of matrices representation
cites work: Controllability and optimal control of a temporal Boolean network
cites work: Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method
cites work: A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
cites work: Output feedback stabilization control design for Boolean control networks
cites work: Solving type-2 fuzzy relation equations via semi-tensor product of matrices
cites work: Singular Boolean networks: Semi-tensor product approach
cites work: Parameterized complexity of basic decision problems for tree automata
cites work: Q4079524
cites work: A general approach for building combinationalPautomata
cites work: Q3958592
cites work: Input-state incidence matrix of Boolean control networks and its applications
cites work: Controllers for reachability specifications for hybrid systems
cites work: Complete synchronization of temporal Boolean networks
DOI: 10.1007/S11704-014-3425-Y
Recommended article: Language acceptability of finite automata based on theory of semi‐tensor product of matrices
Recommended article: Stabilization of probabilistic finite automata based on semi-tensor product of matrices
Recommended article: Q3691065
Recommended article: Language recognition power and succinctness of affine automata
Recommended article: Language Recognition Power and Succinctness of Affine Automata
Recommended article: A matrix approach for FCSR automata
Recommended article: EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
Recommended article: Q4418613
Recommended article: Q5092446
Recommended article: Q4542925
description: scientific article; zbMATH DE number 6995605