{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:03:45Z","timestamp":1777889025749,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319747804","type":"print"},{"value":"9783319747811","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74781-1_9","type":"book-chapter","created":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T15:22:24Z","timestamp":1517498544000},"page":"117-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Finding All Minimum-Size DFA Consistent with\u00a0Given Examples: SAT-Based Approach"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Zakirzyanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anatoly","family":"Shalyto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Ulyantsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"key":"9_CR1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"2006","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (2006)"},{"issue":"9","key":"9_CR2","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C Higuera De La","year":"2005","unstructured":"De La Higuera, C.: A bibliographical study of grammatical inference. Pattern Recogn. 38(9), 1332\u20131348 (2005)","journal-title":"Pattern Recogn."},{"issue":"3","key":"9_CR3","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302\u2013320 (1978)","journal-title":"Inf. Control"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-58473-0_152","volume-title":"Grammatical Inference and Applications","author":"P Dupont","year":"1994","unstructured":"Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 236\u2013245. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58473-0_152"},{"key":"9_CR5","unstructured":"Luke, S., Hamahashi, S., Kitano, H.: Genetic programming. In: Proceedings of the genetic and evolutionary computation conference, vol. 2, pp. 1098\u20131105 (1999)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Lucas, S.M., Reynolds, T.J.: Learning DFA: evolution versus evidence driven state merging. In: The 2003 Congress on Evolutionary Computation, 2003. CEC 2003, vol. 1, pp. 351\u2013358. IEEE (2003)","DOI":"10.1109\/CEC.2003.1299597"},{"key":"9_CR7","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":"9_CR8","unstructured":"Lang, K.J.: Faster algorithms for finding minimal consistent DFAs. Technical report (1999)"},{"issue":"9","key":"9_CR9","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1016\/j.patcog.2004.03.027","volume":"38","author":"M Bugalho","year":"2005","unstructured":"Bugalho, M., Oliveira, A.L.: Inference of regular languages using state merging algorithms with search. Pattern Recogn. 38(9), 1457\u20131467 (2005)","journal-title":"Pattern Recogn."},{"key":"9_CR10","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"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-540-69052-8_70","volume-title":"New Frontiers in Applied Artificial Intelligence","author":"R Lohfert","year":"2008","unstructured":"Lohfert, R., Lu, J.J., Zhao, D.: Solving SQL constraints by incremental translation to SAT. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds.) IEA\/AIE 2008. LNCS (LNAI), vol. 5027, pp. 669\u2013676. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69052-8_70"},{"issue":"9","key":"9_CR12","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1109\/TSE.2013.15","volume":"39","author":"JP Galeotti","year":"2013","unstructured":"Galeotti, J.P., Rosner, N., Pombo, C.G.L., Frias, M.F.: TACO: efficient SAT-based bounded verification using symmetry breaking and tight bounds. IEEE Trans. Softw. Eng. 39(9), 1283\u20131307 (2013)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Ulyantsev, V., Tsarev, F.: Extended finite-state machine induction using SAT-solver. In: Proceedings of ICMLA 2011, vol. 2, pp. 346\u2013349. IEEE (2011)","DOI":"10.1109\/ICMLA.2011.166"},{"issue":"3\u20134","key":"9_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.3233\/FI-2012-768","volume":"120","author":"A Zbrzezny","year":"2012","unstructured":"Zbrzezny, A.: A new translation from ECTL* to SAT. Fundamenta Informaticae 120(3\u20134), 375\u2013395 (2012)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"9_CR15","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s10664-012-9210-3","volume":"18","author":"N Walkinshaw","year":"2013","unstructured":"Walkinshaw, N., Lambeau, B., Damas, C., Bogdanov, K., Dupont, P.: STAMINA: a competition to encourage the development and assessment of software model inference techniques. Empirical Software Engineering 18(4), 791\u2013824 (2013)","journal-title":"Empirical Software Engineering"},{"key":"9_CR16","first-page":"148","volume":"96","author":"J Crawford","year":"1996","unstructured":"Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. KR 96, 148\u2013159 (1996)","journal-title":"KR"},{"key":"9_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":"9_CR18","doi-asserted-by":"crossref","unstructured":"Ulyantsev, V., Buzhinsky, I., Shalyto, A.: Exact finite-state machine identification from scenarios and temporal properties. Int. J. Softw. Tools Technol. Transf. 1\u201321 (2016)","DOI":"10.1007\/s10009-016-0442-1"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"9_CR20","unstructured":"Biere, A.: Splatz, lingeling, plingeling, treengeling, YalSAT entering the SAT competition 2016. In: Proceedings of SAT Competition, pp. 44\u201345 (2016)"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74781-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T23:01:16Z","timestamp":1603753276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74781-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319747804","9783319747811"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74781-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}