Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices

被引：0
|
作者：
Zhipeng ZHANG [1 ,2 ]
Zengqiang CHEN [1 ,2 ]
Zhongxin LIU [1 ,2 ]
机构：
[1] College of Computer and Control Engineering, Nankai University
[2] Tianjin Key Laboratory of Intelligent Robotics, Nankai University
来源：
Science China(Information Sciences) | 2018年 / 61卷 / 12期
基金：
中国国家自然科学基金;
关键词：
Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices;
D O I：
暂无
中图分类号：
TP301.1 [自动机理论];
学科分类号：
081202 ;
摘要：
Dear editor,As mathematical models, finite automata have been a powerful synthesis tool for modeling and analyzing discrete event systems where states and events are a finite logical or discrete set. In deterministic finite automata, the successor can be uniquely determined by the predecessor and input event. In other words, it exhibits a deterministic behavior. As a practical and theoretical motivation, probabilistic finite automata (PFAs)
引用
收藏
页码：202 / 204
页数：3
相关论文
共 50 条
  • [1] Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices
    Zhipeng Zhang
    Zengqiang Chen
    Zhongxin Liu
    Science China Information Sciences, 2018, 61
  • [2] Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices
    Zhang, Zhipeng
    Chen, Zengqiang
    Liu, Zhongxin
    SCIENCE CHINA-INFORMATION SCIENCES, 2018, 61 (12)
  • [3] Stabilization of probabilistic finite automata based on semi-tensor product of matrices
    Zhang, Zhipeng
    Chen, Zengqiang
    Han, Xiaoguang
    Liu, Zhongxin
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2020, 357 (09): : 5173 - 5186
  • [4] Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
    Yongyi Yan
    Zengqiang Chen
    Zhongxin Liu
    Frontiers of Computer Science, 2014, 8 : 948 - 957
  • [5] Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
    Yan, Yongyi
    Chen, Zengqiang
    Liu, Zhongxin
    FRONTIERS OF COMPUTER SCIENCE, 2014, 8 (06) : 948 - 957
  • [6] Language acceptability of finite automata based on theory of semi-tensor product of matrices
    Yue, Jumei
    Yan, Yongyi
    Chen, Zengqiang
    ASIAN JOURNAL OF CONTROL, 2019, 21 (06) : 2634 - 2643
  • [7] Modeling, Reachability and Controllability of Bounded Petri Nets Based on Semi-Tensor Product of Matrices
    Han, Xiaoguang
    Chen, Zengqiang
    Zhang, Kuize
    Liu, Zhongxin
    Zhang, Qing
    ASIAN JOURNAL OF CONTROL, 2020, 22 (01) : 500 - 510
  • [8] Three matrix conditions for the reduction of finite automata based on the theory of semi-tensor product of matrices
    Yue, Jumei
    Yan, Yongyi
    Chen, Zengqiang
    SCIENCE CHINA-INFORMATION SCIENCES, 2020, 63 (02)
  • [9] Three matrix conditions for the reduction of finite automata based on the theory of semi-tensor product of matrices
    Jumei Yue
    Yongyi Yan
    Zengqiang Chen
    Science China Information Sciences, 2020, 63
  • [10] Observability analysis of combined finite automata based upon semi-tensor product of matrices approach
    Chen, Zengqiang
    Zhou, Yingrui
    Zhang, Zhipeng
    Liu, Zhongxin
    TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2021, 43 (03) : 717 - 727
12345