{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T02:47:32Z","timestamp":1777949252446,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819578252","type":"print"},{"value":"9789819578269","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7826-9_10","type":"book-chapter","created":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T22:05:56Z","timestamp":1777845956000},"page":"177-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Decomposition Identification of\u00a0Deterministic Finite Automata from\u00a0Examples"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0603-1899","authenticated-orcid":false,"given":"Junjie","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9260-9697","authenticated-orcid":false,"given":"Jie","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7301-9234","authenticated-orcid":false,"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4343-9323","authenticated-orcid":false,"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6016-7360","authenticated-orcid":false,"given":"Fanjiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-3817","authenticated-orcid":false,"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9179-0893","authenticated-orcid":false,"given":"Miaomiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ashar, P., Devadas, S., Newton, A.R.: Finite State Machine Decomposition, pp. 117\u2013168. Springer, Boston (1992)","DOI":"10.1007\/978-1-4615-3628-4_6"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2019","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transf. 21(1), 1\u201329 (2019)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BFb0054076","volume-title":"Grammatical Inference","author":"F Coste","year":"1998","unstructured":"Coste, F., Nicolas, J.: How considering incompatible state mergings may reduce the DFA induction search tree. In: Honavar, V., Slutzki, G. (eds.) ICGI 1998. LNCS, vol. 1433, pp. 199\u2013210. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054076"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J Daciuk","year":"2000","unstructured":"Daciuk, J., Mihov, S., Watson, B.W., Watson, R.E.: Incremental construction of minimal acyclic finite state automata. Comput. Linguist. 26(1), 3\u201316 (2000)","journal-title":"Comput. Linguist."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Dell\u2019Erba, D., Li, Y., Schewe, S.: DFAMiner: mining minimal separating DFAs from labelled samples. In: FM 2024. LNCS, vol. 14934, pp. 48\u201366. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-71177-0_4"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1162\/artl_r_00025","volume":"17","author":"A Egri-Nagy","year":"2011","unstructured":"Egri-Nagy, A.: Applications of automata theory and algebra via the mathematical theory of complexity to biology, physics, psychology, philosophy, and games. Artif. Life 17(2), 141\u2013143 (2011)","journal-title":"Artif. Life"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/11814771_40","volume-title":"Automated Reasoning","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 483\u2013497. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_40"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. s2-17(1), 75\u2013115 (1918)","DOI":"10.1112\/plms\/s2-17.1.75"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-15488-1_7","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"MJH Heule","year":"2010","unstructured":"Heule, M.J.H., Verwer, S.: Exact DFA identification using SAT solvers. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 66\u201379. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_7"},{"issue":"9","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C de la Higuera","year":"2005","unstructured":"de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recogn. 38(9), 1332\u20131348 (2005)","journal-title":"Pattern Recogn."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ic.2014.09.010","volume":"240","author":"O Kupferman","year":"2015","unstructured":"Kupferman, O., Mosheiff, J.: Prime languages. Inf. Comput. 240, 90\u2013107 (2015)","journal-title":"Inf. Comput."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"KJ Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V., Slutzki, G. (eds.) ICGI 1998. LNCS, vol. 1433, pp. 1\u201312. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054059"},{"key":"10_CR13","unstructured":"Lauffer, N., Yalcinkaya, B., Vazquez-Chanlatte, M., Shah, A., Seshia, S.A.: Learning deterministic finite automata decompositions from examples and demonstrations. In: FMCAD 2022, pp.\u00a01\u20136. IEEE (2022)"},{"key":"10_CR14","unstructured":"Meng, J., et al.: Efficient decomposition identification of deterministic finite automata from examples. arXiv abs\/2509.24347 (2025). https:\/\/arxiv.org\/abs\/2509.24347"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-33386-6_28","volume-title":"Automated Technology for Verification and Analysis","author":"D Neider","year":"2012","unstructured":"Neider, D.: Computing minimal separating DFAs and regular invariants using SAT and SMT solvers. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 354\u2013369. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_28"},{"key":"10_CR16","unstructured":"Neider, D.: Applications of automata learning in verification and synthesis. Ph.D. thesis, RWTH Aachen University (2014)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-319-15579-1_48","volume-title":"Language and Automata Theory and Applications","author":"V Ulyantsev","year":"2015","unstructured":"Ulyantsev, V., Zakirzyanov, I., Shalyto, A.: BFS-based symmetry breaking predicates for DFA identification. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 611\u2013622. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_48"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Ulyantsev, V., Zakirzyanov, I., Shalyto, A.: Symmetry breaking predicates for SAT-based DFA identification. arXiv abs\/1602.05028 (2016)","DOI":"10.1007\/978-3-319-15579-1_48"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","journal-title":"Commun. ACM"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-13435-8_12","volume-title":"Language and Automata Theory and Applications","author":"I Zakirzyanov","year":"2019","unstructured":"Zakirzyanov, I., Morgado, A., Ignatiev, A., Ulyantsev, V., Marques-Silva, J.: Efficient symmetry breaking for SAT-based minimum DFA inference. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 159\u2013173. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_12"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-74781-1_9","volume-title":"Software Engineering and Formal Methods","author":"I Zakirzyanov","year":"2018","unstructured":"Zakirzyanov, I., Shalyto, A., Ulyantsev, V.: Finding all minimum-size DFA consistent with\u00a0given examples: SAT-based approach. In: Cerone, A., Roveri, M. (eds.) SEFM 2017. LNCS, vol. 10729, pp. 117\u2013131. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74781-1_9"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7826-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T22:05:57Z","timestamp":1777845957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7826-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819578252","9789819578269"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7826-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.setta2025.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}