{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:16:13Z","timestamp":1784837773294,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642340253","type":"print"},{"value":"9783642340260","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34026-0_39","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T01:07:20Z","timestamp":1348621640000},"page":"524-538","source":"Crossref","is-referenced-by-count":16,"title":["Learning Minimal Deterministic Automata from Inexperienced Teachers"],"prefix":"10.1007","author":[{"given":"Martin","family":"Leucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Neider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"39_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"39_CR2","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"Angluin, D.: Negative results for equivalence queries. Machine Learning\u00a05, 121\u2013150 (1990)","journal-title":"Machine Learning"},{"issue":"6","key":"39_CR3","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 Transactions on Computers C\u00a021(6), 592\u2013597 (1972)","journal-title":"IEEE Transactions on Computers C"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-00768-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y.-F. Chen","year":"2009","unstructured":"Chen, Y.-F., Farzan, A., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Learning Minimal Separating DFA\u2019s for Compositional Verification. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 31\u201345. Springer, Heidelberg (2009)"},{"issue":"3","key":"39_CR5","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":"39_CR6","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)"},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science","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":"M. Heule","year":"2010","unstructured":"Heule, M., Verwer, S.: Exact DFA Identification Using SAT Solvers. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS, vol.\u00a06339, pp. 66\u201379. Springer, Heidelberg (2010)"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-74792-5_6","volume-title":"Formal Methods for Components and Objects","author":"M. Leucker","year":"2007","unstructured":"Leucker, M.: Learning Meets Verification. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol.\u00a04709, pp. 127\u2013151. Springer, Heidelberg (2007)"},{"issue":"1\/2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1010828029885","volume":"44","author":"A.L. Oliveira","year":"2001","unstructured":"Oliveira, A.L., Silva, J.P.M.: Efficient algorithms for the inference of minimum size dfas. Machine Learning\u00a044(1\/2), 93\u2013119 (2001)","journal-title":"Machine Learning"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Paull, M., Unger, S.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Transactions on Electronic Computers\u00a0(3), 356\u2013367 (1959)","DOI":"10.1109\/TEC.1959.5222697"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34026-0_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:41:25Z","timestamp":1620132085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34026-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340253","9783642340260"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34026-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}