Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Algebraic criteria for finite automata understanding of regular language

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Cheng D Z, Qi H S, Zhao Y. An Introduction to Semi-tensor Product of Matrices and Its Applications. Singapore: World Scientific Publishing Co. Pte. Ltd., 2012

    Book  MATH  Google Scholar 

  2. Xu X R, Hong Y G. Matrix expression and reachability analysis of finite automata. Journal of Control Theory and Applications, 2012, 10(2): 210–215

    Article  MathSciNet  Google Scholar 

  3. Yan Y Y, Chen Z Q, Liu Z X. 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

    Article  MathSciNet  MATH  Google Scholar 

  4. Yue J M, Yan Y Y, Chen Z Q, Jin X. Identification of predictors of Boolean networks from observed attractor states. Mathematical Methods in the Applied Sciences, 2019, DOI:https://doi.org/10.1002/mma.5616

  5. Li F F, Yu Z X. Feedback control and output feedback control for the stabilisation of switched Boolean networks. International Journal of Control, 2015, 89(2): 337–342

    Article  MathSciNet  MATH  Google Scholar 

  6. Yue J M, Yan Y Y, Chen Z Q. 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: https://doi.org/10.1007/s11432-018-9739-9

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant Nos. U1804150, 61573199) and the 2018 Henan Province Science and Technique Foundation (182102210045).

Author information

Authors and Affiliations

  1. School of Information Engineering, Henan University of Science and Technology, Henan, 471003, China

    Yongyi Yan & Zhumu Fu

  2. College of Agricultural Equipment Engineering, Henan University of Science and Technology, Henan, 471003, China

    Jumei Yue

  3. College of Artificial Intelligence, Nankai University, Tianjin, 300071, China

    Zengqiang Chen

Authors
  1. Yongyi Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jumei Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhumu Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zengqiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yan, Y., Yue, J., Fu, Z. et al. Algebraic criteria for finite automata understanding of regular language. Front. Comput. Sci. 13, 1148–1150 (2019). https://doi.org/10.1007/s11704-019-6525-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-019-6525-x

Search

Navigation