{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T03:15:42Z","timestamp":1770347742027,"version":"3.49.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319631202","type":"print"},{"value":"9783319631219","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63121-9_8","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T04:05:15Z","timestamp":1500869115000},"page":"146-169","source":"Crossref","is-referenced-by-count":16,"title":["A Generic Algorithm for Learning Symbolic Automata from Membership Queries"],"prefix":"10.1007","author":[{"given":"Oded","family":"Maler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irini-Eleftheria","family":"Mens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","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. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ic.2015.03.003","volume":"241","author":"E Asarin","year":"2015","unstructured":"Asarin, E., Basset, N., Degorre, A.: Entropy of regular timed languages. Inf. Comput. 241, 142\u2013176 (2015)","journal-title":"Inf. Comput."},{"key":"8_CR3","unstructured":"Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: AMW. CEUR Workshop Proceedings, vol. 619 (2010)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11693017_10","volume-title":"Fundamental Approaches to Software Engineering","author":"T Berg","year":"2006","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 107\u2013121. Springer, Heidelberg (2006). doi: 10.1007\/11693017_10"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/11498490_25","volume-title":"Model-Based Testing of Reactive Systems","author":"T Berg","year":"2005","unstructured":"Berg, T., Raffelt, H.: 19 model checking. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 557\u2013603. Springer, Heidelberg (2005). doi: 10.1007\/11498490_25"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Botin\u010dan, M., Babi\u0107, D.: Sigma*: symbolic learning of input-output specifications. In: POPL, pp. 443\u2013456. ACM (2013)","DOI":"10.1145\/2480359.2429123"},{"key":"8_CR7","volume-title":"Wetware: A Computer in Every Living Cell","author":"D Bray","year":"2009","unstructured":"Bray, D.: Wetware: A Computer in Every Living Cell. Yale University Press, New Haven (2009)"},{"key":"8_CR8","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Stone, C.J., Olshen, R.A.: Classification and Regression Trees. CRC Press, Boca Raton (1984)"},{"issue":"2","key":"8_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016)","journal-title":"Formal Aspects Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"D\u2019Antoni, L., Veanes, M.: Minimization of symbolic automata. In: POPL, pp. 541\u2013554. ACM (2014)","DOI":"10.1145\/2535838.2535849"},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(94)90029-9","volume":"129","author":"B Delyon","year":"1994","unstructured":"Delyon, B., Maler, O.: On the effects of noise and speed on computations. Theoret. Comput. Sci. 129(2), 279\u2013291 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-54577-5_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Drews","year":"2017","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 173\u2013189. Springer, Heidelberg (2017). doi: 10.1007\/978-3-662-54577-5_10"},{"issue":"5","key":"8_CR13","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/0005-1098(72)90033-7","volume":"8","author":"E Mark Gold","year":"1972","unstructured":"Mark Gold, E.: System identification via state characterization. Automatica 8(5), 621\u2013636 (1972)","journal-title":"Automatica"},{"key":"8_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co. Inc., Boston (2006)","edition":"3"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27940-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring canonical register automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 251\u2013266. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-27940-9_17"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-18275-4_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2011","unstructured":"Howar, F., Steffen, B., Merten, M.: Automata learning with automated alphabet abstraction refinement. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 263\u2013277. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-18275-4_19"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-38088-4_9","volume-title":"NASA Formal Methods","author":"M Isberner","year":"2013","unstructured":"Isberner, M., Howar, F., Steffen, B.: Inferring automata with state-local alphabet abstractions. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 124\u2013138. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38088-4_9"},{"issue":"2","key":"8_CR18","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theoret. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR19","volume-title":"Elements of the Theory of Computation","author":"HR Lewis","year":"1997","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice Hall PTR, Upper Saddle River (1997)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-30206-3_12","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O Maler","year":"2004","unstructured":"Maler, O., Nickovic, D.: Monitoring temporal properties of continuous signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT -2004. LNCS, vol. 3253, pp. 152\u2013166. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30206-3_12"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-540-78127-1_26","volume-title":"Pillars of Computer Science","author":"O Maler","year":"2008","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: Checking temporal properties of discrete, timed and continuous behaviors. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 475\u2013505. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78127-1_26"},{"issue":"2","key":"8_CR22","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316\u2013326 (1995)","journal-title":"Inf. Comput."},{"issue":"3:13","key":"8_CR23","first-page":"1","volume":"11","author":"I-E Mens","year":"2015","unstructured":"Mens, I.-E., Maler, O.: Learning regular languages over large ordered alphabets. Log. Methods Comput. Sci. (LMCS) 11(3:13), 1\u201322 (2015)","journal-title":"Log. Methods Comput. Sci. (LMCS)"},{"issue":"4","key":"8_CR24","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9(4), 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1","key":"8_CR25","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"issue":"2","key":"8_CR26","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"RL Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"8_CR27","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS, Boston (1997)"},{"issue":"2","key":"8_CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1022699900025","volume":"4","author":"EP Utgoff","year":"1989","unstructured":"Utgoff, E.P.: Incremental induction of decision trees. Mach. Learn. 4(2), 161\u2013186 (1989)","journal-title":"Mach. Learn."},{"issue":"11","key":"8_CR29","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"issue":"3","key":"8_CR30","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1012291501330","volume":"4","author":"G Noord Van","year":"2001","unstructured":"Van Noord, G., Gerdemann, D.: Finite state transducers with predicates and identities. Grammars 4(3), 263\u2013286 (2001)","journal-title":"Grammars"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-39274-0_3","volume-title":"Implementation and Application of Automata","author":"M Veanes","year":"2013","unstructured":"Veanes, M.: Applications of symbolic finite automata. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 16\u201323. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39274-0_3"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-16242-8_45","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M Veanes","year":"2010","unstructured":"Veanes, M., Bj\u00f8rner, N., De Moura, L.: Symbolic automata constraint solving. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 640\u2013654. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16242-8_45"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., Bj\u00f6rner, N.: Symbolic finite state transducers: algorithms and applications. In: POPL, pp. 137\u2013150. ACM (2012)","DOI":"10.1145\/2103656.2103674"}],"container-title":["Lecture Notes in Computer Science","Models, Algorithms, Logics and Tools"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63121-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T09:28:32Z","timestamp":1569922112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63121-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631202","9783319631219"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63121-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}