{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:09Z","timestamp":1750221069800,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,27]],"date-time":"2018-07-27T00:00:00Z","timestamp":1532649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,27]]},"DOI":"10.1145\/3242840.3242860","type":"proceedings-article","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T12:54:52Z","timestamp":1536843292000},"page":"232-237","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Equivalent State of Finite Automata and Its Judgment Theorem"],"prefix":"10.1145","author":[{"given":"Yue","family":"Xingyan","sequence":"first","affiliation":[{"name":"Software College of Northeastern University, Shenyang, Liaoning"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Peifeng","sequence":"additional","affiliation":[{"name":"Software College of Northeastern University, Shenyang, Liaoning"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Zhao","sequence":"additional","affiliation":[{"name":"Software College of Northeastern University, Shenyang, Liaoning"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4018\/IJACI.2018010107"},{"key":"e_1_3_2_1_2_1","volume-title":"Learning Finite State Machine Specifications from Test Cases{J}","author":"Werner E B M","year":"2010","unstructured":"Werner E B M . Learning Finite State Machine Specifications from Test Cases{J} . 2010 . Werner E B M. Learning Finite State Machine Specifications from Test Cases{J}. 2010."},{"key":"e_1_3_2_1_3_1","first-page":"2981","article-title":"Networks connectivity recovery method based on finite state machine{C}\/\/ Control and Decision Conference","volume":"2017","author":"Zhang Y","unstructured":"Zhang Y , Hao G . Networks connectivity recovery method based on finite state machine{C}\/\/ Control and Decision Conference . IEEE , 2017 : 2981 -- 2986 . Zhang Y, Hao G. Networks connectivity recovery method based on finite state machine{C}\/\/ Control and Decision Conference. IEEE, 2017:2981--2986.","journal-title":"IEEE"},{"key":"e_1_3_2_1_4_1","volume-title":"Dcfs","author":"Matsuura A","year":"2008","unstructured":"Matsuura A , Saito Y. Equivalent Transformation of Minimal Finite Automata over a Two-Letter Alphabet{C}\/\/ International Workshop on Descriptional Complexity of Formal Systems , Dcfs 2008 , Charlottetown, Prince Edward Island , Canada, July. DBLP, 2008: 224--232. Matsuura A, Saito Y. Equivalent Transformation of Minimal Finite Automata over a Two-Letter Alphabet{C}\/\/ International Workshop on Descriptional Complexity of Formal Systems, Dcfs 2008, Charlottetown, Prince Edward Island, Canada, July. DBLP, 2008:224--232."},{"key":"e_1_3_2_1_5_1","volume-title":"Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection{C}\/\/ International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":"\u010ce\u0161ka M","year":"2018","unstructured":"\u010ce\u0161ka M , Havlena V , Hol\u00edk L , Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection{C}\/\/ International Conference on Tools and Algorithms for the Construction and Analysis of Systems . Springer , Cham , 2018 : 155--175. \u010ce\u0161ka M, Havlena V, Hol\u00edk L, et al. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection{C}\/\/ International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, Cham, 2018:155--175."},{"key":"e_1_3_2_1_6_1","volume-title":"Two Parallelization Schemes for the Induction of Nondeterministic Finite Automata on PCs{M}\/\/ Parallel Processing and Applied Mathematics","author":"Jastrzab T.","year":"2018","unstructured":"Jastrzab T. Two Parallelization Schemes for the Induction of Nondeterministic Finite Automata on PCs{M}\/\/ Parallel Processing and Applied Mathematics . 2018 . Jastrzab T. Two Parallelization Schemes for the Induction of Nondeterministic Finite Automata on PCs{M}\/\/ Parallel Processing and Applied Mathematics. 2018."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2578855.2535849"},{"key":"e_1_3_2_1_8_1","volume-title":"DISCRETE MATHEMATICS AND ITS APPLICATIONS{M}","author":"Chartrand G","year":"2012","unstructured":"Chartrand G , Zhang P. DISCRETE MATHEMATICS AND ITS APPLICATIONS{M} . China Machine Press , 2012 . Chartrand G, Zhang P. DISCRETE MATHEMATICS AND ITS APPLICATIONS{M}. China Machine Press, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/568438.568455"},{"key":"e_1_3_2_1_10_1","volume-title":"An Introduction to Formal Languages and Automata{C}\/\/ Jones and Bartlett Publishers","author":"Linz P.","year":"2001","unstructured":"Linz P. An Introduction to Formal Languages and Automata{C}\/\/ Jones and Bartlett Publishers , Inc . 2001 . Linz P. An Introduction to Formal Languages and Automata{C}\/\/ Jones and Bartlett Publishers, Inc. 2001."},{"key":"e_1_3_2_1_11_1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho A V","year":"2006","unstructured":"Aho A V , Lam M S , Sethi R , Compilers: Principles, Techniques, and Tools ( 2 nd Edition){M}. Addison-Wesley Longman Publishing Co. Inc . 2006 . Aho A V, Lam M S, Sethi R, et al. Compilers: Principles, Techniques, and Tools (2nd Edition){M}. Addison-Wesley Longman Publishing Co. Inc. 2006.","edition":"2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.11.013"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-017-9155-x"}],"event":{"name":"ICACS '18: 2018 2nd International Conference on Algorithms, Computing and Systems","sponsor":["Xi'an Jiaotong-Liverpool University Xi'an Jiaotong-Liverpool University"],"location":"Beijing China","acronym":"ICACS '18"},"container-title":["Proceedings of the 2018 2nd International Conference on Algorithms, Computing and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3242840.3242860","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3242840.3242860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:23Z","timestamp":1750208243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3242840.3242860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,27]]},"references-count":13,"alternative-id":["10.1145\/3242840.3242860","10.1145\/3242840"],"URL":"https:\/\/doi.org\/10.1145\/3242840.3242860","relation":{},"subject":[],"published":{"date-parts":[[2018,7,27]]},"assertion":[{"value":"2018-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}