|
|
|
Algebraic criteria for finite automata understanding of regular language |
Yongyi YAN1, Jumei YUE2( ), Zhumu FU1, Zengqiang CHEN3 |
1. School of Information Engineering, Henan University of Science and Technology, Henan 471003, China
2. College of Agricultural Equipment Engineering, Henan University of Science and Technology, Henan 471003, China
3. College of Artificial Intelligence, Nankai University, Tianjin 300071, China |
|
|
|
|
|
|
Corresponding Author(s):
Jumei YUE
|
|
Just Accepted Date: 10 May 2019
Online First Date: 30 May 2019
Issue Date: 25 June 2019
|
|
| 1 |
D Z Cheng, H S Qi, Y Zhao. An Introduction to Semi-tensor Product of Matrices and Its Applications. Singapore: World Scientific Publishing Co. Pte. Ltd., 2012
https://doi.org/10.1142/8323
|
| 2 |
X R Xu, Y G Hong. Matrix expression and reachability analysis of finite automata. Journal of Control Theory and Applications, 2012, 10(2): 210–215
https://doi.org/10.1007/s11768-012-1178-4
|
| 3 |
Y Y Yan, Z Q Chen, Z X Liu. Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition. Frontiers of Computer Science, 2014, 8(6): 948–957
https://doi.org/10.1007/s11704-014-3425-y
|
| 4 |
J M Yue, Y Y Yan, Z Q Chen, X Jin. Identification of predictors of Boolean networks from observed attractor states. Mathematical Methods in the Applied Sciences, 2019, DOI:10.1002/mma.5616
https://doi.org/10.1002/mma.5616
|
| 5 |
F F Li, Z X Yu. Feedback control and output feedback control for the stabilisation of switched Boolean networks. International Journal of Control, 2015, 89(2): 337–342
https://doi.org/10.1080/00207179.2015.1076938
|
| 6 |
J M Yue, Y Y Yan, Z Q Chen. Three matrix conditions for the reduction of finite automata based on the theory of semi-tensor product of matrices. SCIENCE CHINA Information Sciences, 2019, DOI: 10.1007/s11432-018-9739-9
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
