Skip to main content
SpringerLink
Log in

Three matrix conditions for the reduction of finite automata based on the theory of semi-tensor product of matrices

  • Letter
  • Published:
Science China Information Sciences 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

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Almeida J, Zeitoun M. Description and analysis of a bottom-up DFA minimization algorithm. Inf Process Lett, 2008, 107: 52–59

    Article  MathSciNet  Google Scholar 

  2. David J. The average complexity of Moore’s state minimization algorithm is O(nloglogn). Lect Notes Comput Sci, 2010, 6281: 318–329

    Article  Google Scholar 

  3. Peeva K. Equivalence, reduction and minimization of finite automata over semirings. Theory Comput Sci, 1991, 88: 269–285

    Article  MathSciNet  MATH  Google Scholar 

  4. Lamperti G, Scandale M. Incremental determinization and minimization of finite acyclic automata. In: Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, 2013. 2250–2257

    Google Scholar 

  5. Holzer M, Kutrib M. Descriptional and computational complexity of finite automata: a survey. Inf Comput, 2011, 209: 456–470

    Article  MathSciNet  Google Scholar 

  6. Carrasco R C, Forcada M L. Incremental construction and maintenance of minimal finite-state automata. Comput Linguist, 2002, 28: 207–216

    Article  MathSciNet  MATH  Google Scholar 

  7. Zhang ZP, Chen Z Q, Liu Z X. Modeling and reachability of probabilistic finite automata based on semitensor product of matrices. Sci China Inf Sci, 2018, 61: 129202

    Article  MathSciNet  Google Scholar 

  8. Yue J M, Chen Z Q, Yan Y Y, et al. Solvability of k-track assignment problem: a graph approach. Control Theory Appl, 2017, 34: 457–466

    Google Scholar 

  9. Cheng D Z, Qi H S, Zhao Y. An Introduction to Semi-Tensor Product of Matrices and Its Applications. Singapore: World Scientific Publishing, 2012

    Google Scholar 

  10. Aho A V, Sethi R, Ullman J D. Compilers, Principles, Techniques, and Tools. Boston: Addison-Wesley Publishing Corporation, 1986

    Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

  1. College of Agricultural Engineering, Henan University of Science and Technology, Luoyang, 471023, China

    Jumei Yue

  2. College of Information Engineering, Henan University of Science and Technology, Luoyang, 471023, China

    Yongyi Yan

  3. College of Computer and Control Engineering, Nankai University, Tianjin, 300071, China

    Zengqiang Chen

Authors
  1. Jumei Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yongyi Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zengqiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongyi Yan.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yue, J., Yan, Y. & Chen, Z. Three matrix conditions for the reduction of finite automata based on the theory of semi-tensor product of matrices. Sci. China Inf. Sci. 63, 129203 (2020). https://doi.org/10.1007/s11432-018-9739-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-018-9739-9

Search

Navigation