{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:24Z","timestamp":1784484144588,"version":"3.55.0"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_2","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:15Z","timestamp":1784482155000},"page":"23-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Omega-Regular Languages: A Tour of\u00a0Learning Results and\u00a0Canonical Representations"],"prefix":"10.1007","author":[{"given":"Dana","family":"Fisman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elina","family":"Sudit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oded","family":"Zimerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"issue":"2","key":"2_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. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"2_CR2","unstructured":"Angluin, D., Boker, U., Fisman, D.: Families of DFAs as acceptors of $$\\omega $$-regular languages. In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, 22\u201326 August 2016 - Krak\u00f3w, Poland, pp. 11:1\u201311:14 (2016)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-11662-4_10","volume-title":"Algorithmic Learning Theory","author":"D Angluin","year":"2014","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. In: Auer, P., Clark, A., Zeugmann, T., Zilles, S. (eds.) ALT 2014. LNCS (LNAI), vol. 8776, pp. 125\u2013139. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11662-4_10"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.07.031","volume":"650","author":"D Angluin","year":"2016","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. Theor. Comput. Sci. 650, 57\u201372 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1995.1026","volume":"50","author":"D Angluin","year":"1995","unstructured":"Angluin, D., Kharitonov, M.: When won\u2019t membership queries help? J. Comput. Syst. Sci. 50(2), 336\u2013355 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR6","unstructured":"Angluin, D., Antonopoulos, T., Fisman, D.: Strongly unambiguous b\u00fcchi automata are polynomially predictable with membership queries. In: Fern\u00e1ndez, M., Muscholl, A. (eds.) 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, Barcelona, Spain, 13\u201316 January 2020, LIPIcs, pp. 8:1\u20138:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-99253-8_1","volume-title":"Foundations of Software Science and Computation Structures","author":"D Angluin","year":"2022","unstructured":"Angluin, D., Antonopoulos, T., Fisman, D., George, N.: Representing regular languages of infinite words using mod 2 multiplicity automata. In: FoSSaCS 2022. LNCS, vol. 13242, pp. 1\u201320. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99253-8_1"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Angluin, D., Fisman, D.: Constructing concise characteristic samples for acceptors of omega regular languages. Log. Methods Comput. Sci. 20(4) (2024)","DOI":"10.46298\/lmcs-20(4:10)2024"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-45237-7_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Angluin","year":"2020","unstructured":"Angluin, D., Fisman, D., Shoval, Y.: Polynomial identification of $$\\omega $$-automata. In: TACAS 2020. LNCS, vol. 12079, pp. 325\u2013343. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_20"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A Arnold","year":"1985","unstructured":"Arnold, A.: A syntactic congruence for rational $$\\omega $$-languages. Theor. Comput. Sci. 39, 333\u2013335 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR11","unstructured":"Barzdin, J.M., Freivalds, R.V.: On the prediction of total recursive functions. Dokl. Akad. Nauk SSSR 206(3), 521\u2013524 (1972). (in Russian)"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A Beimel","year":"2000","unstructured":"Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM 47(3), 506\u2013530 (2000)","journal-title":"J. ACM"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Bohn, L., L\u00f6ding, C.: Constructing deterministic parity automata from positive and negative examples. TheoretiCS 3 (2024)","DOI":"10.46298\/theoretics.24.17"},{"key":"2_CR14","unstructured":"Bohn, L., L\u00f6ding, C.: Constructing deterministic $$\\omega $$-automata from examples by an extension of the RPNI algorithm. In: Bonchi, F., Puglisi, S.J. (eds.) 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, Tallinn, Estonia, 23\u201327 August 2021, LIPIcs, pp. 20:1\u201320:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"2_CR15","unstructured":"Boker, U.: Why these automata types? In: Barthe, G., Sutcliffe, G., Veanes, M. (eds.) LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16\u201321 November 2018, EPiC Series in Computing, pp. 143\u2013163. EasyChair (2018)"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3584676.3584682","volume":"10","author":"U Boker","year":"2023","unstructured":"Boker, U., Lehtinen, K.: When a little nondeterminism goes a long way: an introduction to history-determinism. ACM SIGLOG News 10(1), 24\u201351 (2023)","journal-title":"ACM SIGLOG News"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-13089-2_10","volume-title":"Language and Automata Theory and Applications","author":"N Bousquet","year":"2010","unstructured":"Bousquet, N., L\u00f6ding, C.: Equivalence and inclusion problem for strongly unambiguous B\u00fcchi automata. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 118\u2013129. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13089-2_10"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/3-540-58027-1_27","volume-title":"Mathematical Foundations of Programming Semantics","author":"H Calbrix","year":"1994","unstructured":"Calbrix, H., Nivat, M., Podelski, A.: Ultimately periodic words of rational $$\\omega $$-languages. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 554\u2013566. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58027-1_27"},{"issue":"1\u20133","key":"2_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(02)00618-7","volume":"297","author":"O Carton","year":"2003","unstructured":"Carton, O., Michel, M.: Unambiguous b\u00fcchi automata. Theor. Comput. Sci. 297(1\u20133), 37\u201381 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR20","unstructured":"Pin, J.-E., Perrin, D.: Infinite Words: Automata, Semigroups, Logic and Games. Springer (2004)"},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.tcs.2003.11.009","volume":"313","author":"C de la Higuera","year":"2004","unstructured":"de la Higuera, C., Janodet, J.-C.: Inference of $$\\omega $$-languages from prefixes. Theor. Comput. Sci. 313(2), 295\u2013312 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR22","unstructured":"Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. In: Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, 20\u201322 July 2001. Preproceedings, pp. 67\u201378 (2001)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"EE Stearns","year":"1985","unstructured":"Stearns, E.E., Hunt, B.: On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata. SIAM J. Comput. 14, 598\u2013611 (1985)","journal-title":"SIAM J. Comput."},{"key":"2_CR24","unstructured":"Ehlers, R., Schewe, S.: Natural colors of infinite words. In: Dawar, A., Guruswami, V. (eds.) 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, IIT Madras, Chennai, India, 18\u201320 December 2022, LIPIcs, pp. 36:1\u201336:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Farzan, A., Chen, Y.-F., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Extending automated compositional verification to the full class of $$\\omega $$-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 4963, pp. 2\u201317. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78800-3_2"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jlamp.2018.03.002","volume":"98","author":"D Fisman","year":"2018","unstructured":"Fisman, D.: Inferring regular languages and $$\\omega $$-languages. J. Log. Algebr. Meth. Program. 98, 27\u201349 (2018)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Fisman, D., Frenkel, H., Zilles, S.: Inferring symbolic automata. Log. Methods Comput. Sci. 19(2) (2023)","DOI":"10.46298\/lmcs-19(2:5)2023"},{"key":"2_CR28","unstructured":"Fisman, D., Goldberg, E., Zimerman, O.: A robust measure on FDFAs following duo-normalized acceptance. In: Kr\u00e1lovic, R., Kucera, A. (eds.) 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, 26\u201330 August 2024, Bratislava, Slovakia. LIPIcs, , vol. 306, pp. 53:1\u201353:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"2_CR29","unstructured":"Fisman, D., Sudit, E.: Omega-regular robustness. CoRR, abs\/2503.12631 (2025)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0019358","volume-title":"Baltic Computer Science","author":"R Freivalds","year":"1991","unstructured":"Freivalds, R., B\u0101rzdi\u0146\u0161, J., Podnieks, K.: Inductive inference of recursive functions: complexity bounds. In: B\u0101rzdin\u0161, J., Bj\u00f8rner, D. (eds.) Baltic Computer Science. LNCS, vol. 502, pp. 111\u2013155. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0019358"},{"issue":"3","key":"2_CR31","doi-asserted-by":"publisher","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"},{"issue":"2","key":"2_CR32","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jcss.1996.0020","volume":"52","author":"SA Goldman","year":"1996","unstructured":"Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. J. Comput. Syst. Sci. 52(2), 255\u2013267 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"2_CR33","first-page":"359","volume":"12","author":"H J\u00fcrgensen","year":"1983","unstructured":"J\u00fcrgensen, H., Thierrin, G.: On $$\\omega $$-languages whose syntactic monoid is trivial. Int. J. Parallel Prog. 12(5), 359\u2013365 (1983)","journal-title":"Int. J. Parallel Prog."},{"key":"2_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106133","volume":"171","author":"A Kaznatcheev","year":"2021","unstructured":"Kaznatcheev, A., Panangaden, P.: Weighted automata are compact and actively learnable. Inf. Process. Lett. 171, 106133 (2021)","journal-title":"Inf. Process. Lett."},{"key":"2_CR35","unstructured":"Klarlund, N.: A homomorphism concepts for omega-regularity. In: Computer Science Logic, 8th International Workshop, CSL 1994, Kazimierz, Poland, 25\u201330 September 1994, Selected Papers, pp. 471\u2013485 (1994)"},{"issue":"4","key":"2_CR36","doi-asserted-by":"publisher","first-page":"351","DOI":"10.3233\/FI-2021-2046","volume":"180","author":"D Kuperberg","year":"2021","unstructured":"Kuperberg, D., Pinault, L., Pous, D.: Coinductive algorithms for B\u00fcchi automata. Fundam. Informaticae 180(4), 351\u2013373 (2021)","journal-title":"Fundam. Informaticae"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Li, Y., Schewe, S., Tang, Q.: A novel family of finite automata for recognizing and learning \u00f8mega-regular languages. In: Automated Technology for Verification and Analysis - 21st International Symposium, ATVA, pp. 53\u201373 (2023)","DOI":"10.1007\/978-3-031-45329-8_3"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-17462-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Li","year":"2019","unstructured":"Li, Y., Sun, X., Turrini, A., Chen, Y.-F., Xu, J.: ROLL 1.0: $$\\omega $$-regular language learning library. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 365\u2013371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_23"},{"issue":"4","key":"2_CR39","first-page":"195","volume":"10","author":"R Lindner","year":"1974","unstructured":"Lindner, R., Staiger, L.: Eine Bemerkung \u00fcber nichtkonstantenfreie sequentielle operatoren. Elektronische Informationsverarbeitung und Kybernetik 10(4), 195\u2013202 (1974)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"L\u00f6ding, C., Walukiewicz, I.: Minimal history-deterministic co-b\u00fcchi automata: congruences and passive learning. In: 40th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, 23\u201326 June 2025, pp. 431\u2013443. IEEE (2025)","DOI":"10.1109\/LICS65433.2025.00039"},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","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":"1","key":"2_CR42","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00312-X","volume":"183","author":"O Maler","year":"1997","unstructured":"Maler, O., Staiger, L.: On syntactic congruences for omega-languages. Theor. Comput. Sci. 183(1), 93\u2013112 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, 22\u201324 August 1990, pp. 377\u2013410 (1990)","DOI":"10.1145\/93385.93442"},{"key":"2_CR44","unstructured":"Michel, M.: Complementation is much more difficult with automata on infinite words. In: Manuscript, CNET (1988)"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition. Series in Machine Perception and Artificial Intelligence, vol. 5, pp. 99\u2013108. World Scientific (1992)","DOI":"10.1142\/9789812797919_0007"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Radi, B.A., Kupferman, O.: Minimization and canonization of GFG transition-based automata. Log. Methods Comput. Sci. 18(3) (2022)","DOI":"10.46298\/lmcs-18(3:16)2022"},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Automata and rational expressions. In: Pin, J.-\u00c9. (ed.) Handbook of Automata Theory, pp. 39\u201378. European Mathematical Society Publishing House, Z\u00fcrich, Switzerland (2021)","DOI":"10.4171\/automata-1\/2"},{"issue":"3","key":"2_CR49","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","volume":"27","author":"L Staiger","year":"1983","unstructured":"Staiger, L.: Finite-state omega-languages. J. Comput. Syst. Sci. 27(3), 434\u2013448 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR50","unstructured":"Trakhtenbrot, B.: Finite automata and monadic second order logic. Siberian Math J. 103\u2013131 (1962)"},{"key":"2_CR51","unstructured":"Trakhtenbrot, B.A., Barzdin, J.M.: Finite Automata: Behavior and Synthesis. Fundamental Studies in Computer Science, vol. 1. North-Holland Publishing Company, Amsterdam (1973). Translated from Russian by D. Louvish"},{"key":"2_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-07389-2_231","volume-title":"Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975","author":"K Wagner","year":"1975","unstructured":"Wagner, K.: A hierarchy of regular sequence sets. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1975. LNCS, vol. 32, pp. 445\u2013449. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07389-2_231"},{"key":"2_CR53","unstructured":"Wilke, T.: Past, present, and infinite future. In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11\u201315 July 2016, Rome, Italy, pp. 95:1\u201395:14 (2016)"},{"key":"2_CR54","unstructured":"Wilke, T.: Backward deterministic B\u00fcchi automata on infinite words. In: FSTTCS (2017)"},{"key":"2_CR55","doi-asserted-by":"crossref","unstructured":"Zeugmann, T., Zilles, S.: Learning recursive functions: a survey. Theor. Comput. Sci. 397(1), 4\u201356 (2008). Forty Years of Inductive Inference: Dedicated to the 60th Birthday of Rolf Wiehagen","DOI":"10.1016\/j.tcs.2008.02.021"}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:18Z","timestamp":1784482158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}