{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:46:52Z","timestamp":1743050812191,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031770180"},{"type":"electronic","value":"9783031770197"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"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-77019-7_6","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:48:35Z","timestamp":1732222115000},"page":"96-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dual Adjunction Between $$\\varOmega $$-Automata and Wilke Algebra Quotients"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-6232-5604","authenticated-orcid":false,"given":"Anton","family":"Chernev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7061-1219","authenticated-orcid":false,"given":"Helle Hvid","family":"Hansen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0502-391X","authenticated-orcid":false,"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"6_CR1","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). https:\/\/doi.org\/10.1016\/j.tcs.2016.07.031","journal-title":"Theor. Comput. Sci."},{"key":"6_CR2","unstructured":"Awodey, S.: Category Theory, 2nd edn. Oxford University Press, Inc. (2010). https:\/\/dl.acm.org\/doi\/10.5555\/2060081"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-031-24117-8_3","volume-title":"Samson Abramsky on Logic and Structure in Computer Science and Beyond","author":"N Bezhanishvili","year":"2023","unstructured":"Bezhanishvili, N., et al.: Minimisation in logical form. In: Palmigiano, A., Sadrzadeh, M. (eds.) Samson Abramsky on Logic and Structure in Computer Science and Beyond, pp. 89\u2013127. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-24117-8_3"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-04081-8_10","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M Boja\u0144czyk","year":"2009","unstructured":"Boja\u0144czyk, M., Idziaszek, T.: Algebra for Infinite Forests with an Application to the Temporal Logic EF. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 131\u2013145. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_10"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2490818","volume":"15","author":"F Bonchi","year":"2014","unstructured":"Bonchi, F., Bonsangue, M.M., Hansen, H.H., Panangaden, P., Rutten, J.J.M.M., Silva, A.: Algebra-coalgebra duality in Brzozowski\u2019s minimization algorithm. ACM Trans. Comput. Log. 15(1), 1\u201329 (2014). https:\/\/doi.org\/10.1145\/2490818","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR6","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"},{"key":"6_CR7","unstructured":"Champarnaud, J.M., Khorsi, A., Parantho\u00ebn, T.: Split and join for minimizing: Brzozowski\u2019s algorithm. In: Proceedings of the Prague Stringology Conference, pp. 96\u2013104 (2002). https:\/\/www.stringology.org\/event\/2002\/p11.html"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-32784-1_6","volume-title":"Coalgebraic Methods in Computer Science","author":"V Ciancia","year":"2012","unstructured":"Ciancia, V., Venema, Y.: Stream Automata Are Coalgebras. In: Pattinson, D., Schr\u00f6der, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 90\u2013108. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32784-1_6"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Ciancia, V., Venema, Y.: $$\\varOmega $$-automata: A coalgebraic perspective on regular $$\\omega $$-languages. In: 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0139, pp. 5:1\u20135:18 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2019.5","DOI":"10.4230\/LIPIcs.CALCO.2019.5"},{"key":"6_CR10","unstructured":"Cruchten, M.: Topics in $$\\varOmega $$-Automata: a Journey Through Lassos, Algebra, Coalgebra and Expressions. Master\u2019s thesis, University of Amsterdam (2022). https:\/\/eprints.illc.uva.nl\/id\/eprint\/2209"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-981-97-2340-9_10","volume-title":"Theory and Applications of Models of Computation","author":"M Cruchten","year":"2024","unstructured":"Cruchten, M.: Kleene theorems for lasso languages and $$\\omega $$-languages. In: Chen, X., Li, B. (eds.) Theory and Applications of Models of Computation, pp. 111\u2013123. Springer Nature Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-97-2340-9_10"},{"key":"6_CR12","unstructured":"Cruchten, M.: On transition constructions for automata: A categorical perspective. Tech. rep. (2024). http:\/\/arxiv.org\/abs\/2406.19312"},{"key":"6_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games: a Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games: a Guide to Current Research. Springer-Verlag (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/S00224-014-9595-Z","volume":"58","author":"T Idziaszek","year":"2016","unstructured":"Idziaszek, T., Skrzypczak, M., Bojanczyk, M.: Regular languages of thin trees. Theory Comput. Syst. 58(4), 614\u2013663 (2016). https:\/\/doi.org\/10.1007\/S00224-014-9595-Z","journal-title":"Theory Comput. Syst."},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4721-8","volume-title":"Categories for the Working Mathematician, Graduate Texts in Mathematics","author":"S MacLane","year":"1971","unstructured":"MacLane, S.: Categories for the Working Mathematician, Graduate Texts in Mathematics, vol. 5. Springer-Verlag (1971). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8"},{"key":"6_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/S107989860000336X","volume-title":"Infinite Words: Automata, Semigroups, Logic and Games, Pure and Applied Mathematics","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words: Automata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol. 141. Elsevier (2004). https:\/\/doi.org\/10.1017\/S107989860000336X"},{"key":"6_CR17","unstructured":"Pin, J.E.: Mathematical Foundations of Automata Theory (2022). https:\/\/www.irif.fr\/~jep\/PDF\/MPRI\/MPRI.pdf"},{"key":"6_CR18","unstructured":"Planting, A.: From Automata to Monoids and Back Again. Master\u2019s thesis, Radboud University (2013)"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Rot, J.: Coalgebraic minimization of automata by initiality and finality. In: Birkedal, L. (ed.) Mathematical Foundations of Programming Semantics, MFPS 2016. Electronic Notes in Theoretical Computer Science, vol.\u00a0325, pp. 253\u2013276. Elsevier (2016). https:\/\/doi.org\/10.1016\/J.ENTCS.2016.09.042","DOI":"10.1016\/J.ENTCS.2016.09.042"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"JJMM Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00056-6","journal-title":"Theor. Comput. Sci."},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Urbat, H., Schr\u00f6der, L.: Automata learning: an algebraic approach. In: Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science. LICS \u201920, pp. 900\u2013914 (2020). https:\/\/doi.org\/10.1145\/3373718.3394775","DOI":"10.1145\/3373718.3394775"},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218196793000287","volume":"3","author":"T Wilke","year":"1993","unstructured":"Wilke, T.: An algebraic theory for regular languages of finite and infinite words. Int. J. Algebra Comput. 3(4), 447\u2013490 (1993). https:\/\/doi.org\/10.1142\/S0218196793000287","journal-title":"Int. J. Algebra Comput."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:29:25Z","timestamp":1732224565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}