{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T14:26:05Z","timestamp":1790864765554,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642154874","type":"print"},{"value":"9783642154881","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15488-1_7","type":"book-chapter","created":{"date-parts":[[2010,9,9]],"date-time":"2010-09-09T09:59:54Z","timestamp":1284026394000},"page":"66-79","source":"Crossref","is-referenced-by-count":63,"title":["Exact DFA Identification Using SAT Solvers"],"prefix":"10.1007","author":[{"given":"Marijn J. H.","family":"Heule","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sicco","family":"Verwer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"9","key":"7_CR1","doi-asserted-by":"publisher","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 Recognition\u00a038(9), 1332\u20131348 (2005)","journal-title":"Pattern Recognition"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"7_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K.J. 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.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, p. 1. Springer, Heidelberg (1998)"},{"key":"7_CR4","series-title":"Series in Machine Perception and Artificial Intelligence","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1142\/9789812797902_0004","volume-title":"Pattern Recognition and Image Analysis","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, vol.\u00a01, pp. 49\u201361. World Scientific, Singapore (1992)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Oliveira, A.L., Marques-Silva, J.P.: Efficient search techniques for the inference of minimum sized finite state machines. In: SPIRE, pp. 81\u201389 (1998)","DOI":"10.1109\/SPIRE.1998.712986"},{"key":"7_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-3-540-30195-0_4","volume-title":"Grammatical Inference: Algorithms and Applications","author":"J. Abela","year":"2004","unstructured":"Abela, J., Coste, F., Spina, S.: Mutually compatible and incompatible merges for the search of the smallest consistent DFA. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol.\u00a03264, pp. 28\u201339. Springer, Heidelberg (2004)"},{"key":"7_CR7","unstructured":"Lang, K.J.: Faster algorithms for finding minimal consistent DFAs. Technical report, NEC Research Institute (1999)"},{"key":"7_CR8","doi-asserted-by":"publisher","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 Recognition\u00a038, 1457\u20131467 (2005)","journal-title":"Pattern Recognition"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/307418.307477","volume-title":"DATE 1999","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Glass, T.: Combinational equivalence checking using satisfiability and recursive learning. In: DATE 1999, p. 33. ACM, New York (1999)"},{"issue":"2-3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J. Endrullis","year":"2008","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. J. Autom. Reason.\u00a040(2-3), 195\u2013220 (2008)","journal-title":"J. Autom. Reason."},{"key":"7_CR12","unstructured":"Coste, F., Nicolas, J.: Regular inference as a graph coloring problem. In: Workshop on Grammatical Inference, Automata Induction, and Language Acquisition, ICML 1997 (1997)"},{"key":"7_CR13","series-title":"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.\u00a04130, pp. 483\u2013497. Springer, Heidelberg (2006)"},{"issue":"6","key":"7_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"21","author":"A.W. Biermann","year":"1972","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput.\u00a021(6), 592\u2013597 (1972)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Sakallah, K.A.: Symmetry and Satisfiability. In: Handbook of Satisfiability, ch.\u00a010, pp. 289\u2013338. IOS Press, Amsterdam (2009)","DOI":"10.3233\/978-1-58603-929-5-289"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00037-2","volume":"96-97","author":"O. Kullmann","year":"1999","unstructured":"Kullmann, O.: On a generalization of extended resolution. Discrete Applied Mathematics\u00a096-97(1), 149\u2013176 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-12002-2_10","volume-title":"TACAS 2010","author":"M. Jarvisalo","year":"2010","unstructured":"Jarvisalo, M., Biere, A., Heule, M.J.H.: Blocked clause elimination. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 129\u2013144. Springer, Heidelberg (2010)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/SPIRE.1998.712986","volume-title":"South American Symposium on String Processing and Information Retrieval","author":"A.L. Oliveira","year":"1998","unstructured":"Oliveira, A.L., Marques-Silva, J.P.: Efficient search techniques for the inference of minimum size finite automata. In: South American Symposium on String Processing and Information Retrieval, pp. 81\u201389. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"4","author":"A. Biere","year":"2008","unstructured":"Biere, A.: Picosat essentials. Journal on Satisfiability, Boolean Modeling and Computation\u00a04, 75\u201397 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/ICCAD.2007.4397256","volume-title":"ICCAD 2007: International conference on Computer-aided design","author":"M.N. Velev","year":"2007","unstructured":"Velev, M.N.: Exploiting hierarchy and structure to efficiently solve graph coloring as sat. In: ICCAD 2007: International conference on Computer-aided design, Piscataway, NJ, USA, pp. 135\u2013142. IEEE Press, Los Alamitos (2007)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-02777-2_22","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"B. Schaafsma","year":"2009","unstructured":"Schaafsma, B., Heule, M.J.H., van Maaren, H.: Dynamic symmetry breaking by simulating Zykov contraction. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 223\u2013236. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Theoretical Results and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15488-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:25:59Z","timestamp":1740504359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15488-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642154874","9783642154881"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15488-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}