{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T07:03:32Z","timestamp":1789110212858,"version":"build-2803163510"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11432-018-9739-9","type":"journal-article","created":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T09:03:27Z","timestamp":1567155807000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Three matrix conditions for the reduction of finite automata based on the theory of semi-tensor product of matrices"],"prefix":"10.1007","volume":"63","author":[{"given":"Jumei","family":"Yue","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongyi","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zengqiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"key":"9739_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ipl.2008.01.003","volume":"107","author":"A J","year":"2008","unstructured":"Almeida J, Zeitoun M. Description and analysis of a bottom-up DFA minimization algorithm. Inf Process Lett, 2008, 107: 52\u201359","journal-title":"Inf Process Lett"},{"key":"9739_CR2","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-15155-2_29","volume":"6281","author":"D J","year":"2010","unstructured":"David J. The average complexity of Moore\u2019s state minimization algorithm is O(nloglogn). Lect Notes Comput Sci, 2010, 6281: 318\u2013329","journal-title":"Lect Notes Comput Sci"},{"key":"9739_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0304-3975(91)90377-E","volume":"88","author":"P K","year":"1991","unstructured":"Peeva K. Equivalence, reduction and minimization of finite automata over semirings. Theory Comput Sci, 1991, 88: 269\u2013285","journal-title":"Theory Comput Sci"},{"key":"9739_CR4","first-page":"2250","volume-title":"Proceedings of IEEE International Conference on Systems, Man, and Cybernetics","author":"L G","year":"2013","unstructured":"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\u20132257"},{"key":"9739_CR5","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"H M","year":"2011","unstructured":"Holzer M, Kutrib M. Descriptional and computational complexity of finite automata: a survey. Inf Comput, 2011, 209: 456\u2013470","journal-title":"Inf Comput"},{"key":"9739_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1162\/089120102760173652","volume":"28","author":"C R C","year":"2002","unstructured":"Carrasco R C, Forcada M L. Incremental construction and maintenance of minimal finite-state automata. Comput Linguist, 2002, 28: 207\u2013216","journal-title":"Comput Linguist"},{"key":"9739_CR7","doi-asserted-by":"publisher","first-page":"129202","DOI":"10.1007\/s11432-018-9507-7","volume":"61","author":"Z ZP","year":"2018","unstructured":"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","journal-title":"Sci China Inf Sci"},{"key":"9739_CR8","first-page":"457","volume":"34","author":"Y J M","year":"2017","unstructured":"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\u2013466","journal-title":"Control Theory Appl"},{"key":"9739_CR9","volume-title":"An Introduction to Semi-Tensor Product of Matrices and Its Applications","author":"C D Z","year":"2012","unstructured":"Cheng D Z, Qi H S, Zhao Y. An Introduction to Semi-Tensor Product of Matrices and Its Applications. Singapore: World Scientific Publishing, 2012"},{"key":"9739_CR10","volume-title":"Compilers, Principles, Techniques, and Tools","author":"A A V","year":"1986","unstructured":"Aho A V, Sethi R, Ullman J D. Compilers, Principles, Techniques, and Tools. Boston: Addison-Wesley Publishing Corporation, 1986"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9739-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-018-9739-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-018-9739-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T11:27:01Z","timestamp":1683890821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-018-9739-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,9]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["9739"],"URL":"https:\/\/doi.org\/10.1007\/s11432-018-9739-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,9]]},"assertion":[{"value":"12 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"129203"}}