{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:19:59Z","timestamp":1759191599341,"version":"3.44.0"},"reference-count":10,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.429.11","type":"journal-article","created":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T19:20:49Z","timestamp":1758568849000},"page":"203-216","source":"Crossref","is-referenced-by-count":0,"title":["Fibrational Perspectives on Determinization of Finite-State Automata"],"prefix":"10.4204","volume":"429","author":[{"given":"Thea","family":"Li","sequence":"first","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2025,9,25]]},"reference":[{"key":"adamek","series-title":"Mathematics and its Applications","volume-title":"Automata and Algebras in Categories","author":"Ad\u00e1mek","year":"1990"},{"key":"Altenkirch_2015","doi-asserted-by":"publisher","DOI":"10.2168\/lmcs-11(1:3)2015","article-title":"Monads need not be endofunctors","volume":"Volume 11, Issue 1","author":"Altenkirch","year":"2015","journal-title":"Logical Methods in Computer Science"},{"key":"ARBIB","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0022-4049(80)90090-0","article-title":"Machines in a category","volume":"19","author":"Arbib","year":"1980","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"9","key":"Arkor_2024","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2024.107676","article-title":"The formal theory of relative monads","volume":"228","author":"Arkor","year":"2024","journal-title":"Journal of Pure and Applied Algebra"},{"key":"colcombet","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23638\/LMCS-16(1:32)2020","article-title":"Automata Minimization: a Functorial approach","author":"Colcombet","year":"2020","journal-title":"Logical Methods in Computer Science"},{"issue":"4","key":"EILENBERG","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/S0019-9958(67)90670-5","article-title":"Automata in general algebras","volume":"11","author":"Eilenberg","year":"1967","journal-title":"Information and Control"},{"key":"mellies","article-title":"Parsing as a lifting problem and the Chomsky-Sch\u00fctzenberger representation theorem","volume-title":"MFPS 2022 - 38th conference on Mathematical Foundations for Programming Semantics","author":"Melli\u00e8s","year":"2022"},{"issue":"2","key":"scott","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite Automata and Their Decision Problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM Journal of Research and Development"},{"issue":"1","key":"RUTTEN","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal coalgebra: a theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"sobociski","series-title":"Coalgebraic Methods in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-32784-1_3","article-title":"Relational Presheaves as Labelled Transition Systems","volume-title":"11th International Workshop on Coalgebraic Methods in Computer Science (CMCS)","volume":"LNCS-7399","author":"Soboci\u0144ski","year":"2012"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T18:16:37Z","timestamp":1759169797000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2410.00675v2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,25]]},"references-count":10,"URL":"https:\/\/doi.org\/10.4204\/eptcs.429.11","relation":{},"ISSN":["2075-2180"],"issn-type":[{"type":"electronic","value":"2075-2180"}],"subject":[],"published":{"date-parts":[[2025,9,25]]}}}