{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:16:08Z","timestamp":1784837768391,"version":"3.55.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031757778","type":"print"},{"value":"9783031757785","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-75778-5_8","type":"book-chapter","created":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T12:09:15Z","timestamp":1731845355000},"page":"155-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["$$L^{\\#}$$ for\u00a0DFAs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3955-1910","authenticated-orcid":false,"given":"Frits","family":"Vaandrager","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martijn","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,18]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-58473-0_149","volume-title":"Grammatical Inference and Applications","author":"R Alquezar","year":"1994","unstructured":"Alquezar, R., Sanfeliu, A.: A hybrid connectionist-symbolic approach to regular grammatical inference based on neural learning and hierarchical clustering. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 203\u2013211. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58473-0_149"},{"issue":"2","key":"8_CR2","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. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-14295-6_32","volume-title":"Computer Aided Verification","author":"B Bollig","year":"2010","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: libalf: the automata learning framework. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 360\u2013364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_32"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/08839510701853200","volume":"22","author":"P Dupont","year":"2008","unstructured":"Dupont, P., Lambeau, B., Damas, C., Lamsweerde, A.: The QSM algorithm and its application to software behavior model induction. Appl. Artif. Intell. 22, 77\u2013115 (2008). https:\/\/doi.org\/10.1080\/08839510701853200","journal-title":"Appl. Artif. Intell."},{"key":"8_CR5","unstructured":"Frohme, M.T.: Active automata learning with adaptive distinguishing sequences. CoRR abs\/1902.01139 (2019). http:\/\/arxiv.org\/abs\/1902.01139"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Geuvers, H., Jacobs, B.: Relating apartness and bisimulation. Logical Methods Comput. Sci. 17(3) (2021). https:\/\/doi.org\/10.46298\/lmcs-17(3:15)2021","DOI":"10.46298\/lmcs-17(3:15)2021"},{"key":"8_CR7","unstructured":"Higuera, C.D.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, April 2010"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Howar, F., Steffen, B.: Active automata learning as black-box search and lazy partition refinement. In: Jansen, N., Stoelinga, M., van\u00a0den Bos, P. (eds.) A Journey from Process Algebra via Timed Automata to Model Learning - Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday. LNCS, vol. 13560, pp. 321\u2013338. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15629-8_17","DOI":"10.1007\/978-3-031-15629-8_17"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-21690-4_32","volume-title":"Computer Aided Verification","author":"M Isberner","year":"2015","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 487\u2013495. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32"},{"key":"8_CR10","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. Ph.D. thesis, Technical University Dortmund, Germany (2015). http:\/\/hdl.handle.net\/2003\/34282"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press (1994)","DOI":"10.7551\/mitpress\/3897.001.0001"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/12.272431","volume":"43","author":"D Lee","year":"1994","unstructured":"Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306\u2013320 (1994)","journal-title":"IEEE Trans. Comput."},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: HLDVT 2004: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International, pp. 95\u2013100. IEEE Computer Society, Washington, DC, USA (2004). https:\/\/doi.org\/10.1109\/HLDVT.2004.1431246","DOI":"10.1109\/HLDVT.2004.1431246"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11334-005-0016-y","volume":"1","author":"T Margaria","year":"2005","unstructured":"Margaria, T., Raffelt, H., Steffen, B.: Knowledge-based relevance filtering for efficient system-level test-based model generation. Innov. Syst. Softw. Eng. 1(2), 147\u2013156 (2005). https:\/\/doi.org\/10.1007\/s11334-005-0016-y","journal-title":"Innov. Syst. Softw. Eng."},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Moerman, J., Wi\u00dfmann, T.: State identification and verification with satisfaction. In: Jansen, N., Stoelinga, M., van\u00a0den Bos, P. (eds.) A Journey from Process Algebra via Timed Automata to Model Learning - Essays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday. LNCS, vol. 13560, pp. 450\u2013466. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15629-8_23","DOI":"10.1007\/978-3-031-15629-8_23"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/S11334-022-00449-3","volume":"18","author":"E Muskardin","year":"2022","unstructured":"Muskardin, E., Aichernig, B.K., Pill, I., Pferscher, A., Tappler, M.: AALpy: an active automata learning library. Innov. Syst. Softw. Eng. 18(3), 417\u2013426 (2022). https:\/\/doi.org\/10.1007\/S11334-022-00449-3","journal-title":"Innov. Syst. Softw. Eng."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-22348-9_23","volume-title":"Models, Mindsets, Meta: The What, the How, and the Why Not?","author":"D Neider","year":"2019","unstructured":"Neider, D., Smetsers, R., Vaandrager, F., Kuppens, H.: Benchmarks for automata learning and conformance testing. In: Margaria, T., Graf, S., Larsen, K.G. (eds.) Models, Mindsets, Meta: The What, the How, and the Why Not? LNCS, vol. 11200, pp. 390\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22348-9_23"},{"key":"8_CR19","unstructured":"Niese, O.: An integrated approach to testing complex systems. Ph.D. thesis, University of Dortmund (2003)"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Oncina, J., Garc\u00eda, P.: Inferring regular languages in polynomial updated time. Pattern Recog. Image Anal., 49\u201361 (1992). https:\/\/doi.org\/10.1142\/9789812797902_0004","DOI":"10.1142\/9789812797902_0004"},{"issue":"5","key":"8_CR21","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10009-009-0111-8","volume":"11","author":"H Raffelt","year":"2009","unstructured":"Raffelt, H., Steffen, B., Berg, T., Margaria, T.: LearnLib: a framework for extrapolating behavioral models. STTT 11(5), 393\u2013407 (2009)","journal-title":"STTT"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Rivest, R., Schapire, R.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993). https:\/\/doi.org\/10.1006\/inco.1993.1021","DOI":"10.1006\/inco.1993.1021"},{"key":"8_CR23","unstructured":"Sanders, M.: The Lsharp algorithm for deterministic finite automata. Bachelor thesis, ICIS, Radboud University Nijmegen, May 2024. https:\/\/www.cs.ru.nl\/bachelors-theses\/2024\/Martijn_Sanders___1028766___The_Lsharp_Algorithm_for_Deterministic_Finite_Automata.pdf"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring mealy machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 207\u2013222. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_14"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, 2 edn. Cambridge University Press (2000). https:\/\/doi.org\/10.1017\/CBO9781139168717","DOI":"10.1017\/CBO9781139168717"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-99524-9_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Vaandrager","year":"2022","unstructured":"Vaandrager, F., Garhewal, B., Rot, J., Wi\u00dfmann, T.: A new approach for active automata learning based on apartness. In: TACAS 2022. LNCS, vol. 13243, pp. 223\u2013243. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_12"}],"container-title":["Lecture Notes in Computer Science","Principles of Verification: Cycling the Probabilistic Landscape"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75778-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T13:02:56Z","timestamp":1731848576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75778-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,18]]},"ISBN":["9783031757778","9783031757785"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75778-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,18]]},"assertion":[{"value":"18 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}