{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:33Z","timestamp":1762458993885},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28729-9_4","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T20:47:40Z","timestamp":1332449260000},"page":"58-73","source":"Crossref","is-referenced-by-count":21,"title":["A Coalgebraic Perspective on Minimization and Determinization"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Ad\u00e1mek","sequence":"first","affiliation":[]},{"given":"Filippo","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"H\u00fclsbusch","sequence":"additional","affiliation":[]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"589","volume":"15","author":"J. Ad\u00e1mek","year":"1974","unstructured":"Ad\u00e1mek, J.: Free algebras and automata realizations in the language of categories. Comment.\u00a0Math.\u00a0Univ.\u00a0Carolin.\u00a015, 589\u2013602 (1974)","journal-title":"Comment.\u00a0Math.\u00a0Univ.\u00a0Carolin."},{"key":"4_CR2","unstructured":"Ad\u00e1mek, J., Bonchi, F., H\u00fclsbusch, M., K\u00f6nig, B., Milius, S., Silva, A.: A coalgebraic perspective on minimization and determinization (extended version), \n                  \n                    http:\/\/alexandrasilva.org\/files\/fossacs12-extended.pdf"},{"key":"4_CR3","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.E.: Abstract and Concrete Categories \u2013 The Joy of Cats. Wiley (1990)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0304-3975(95)00011-K","volume":"150","author":"J. Ad\u00e1mek","year":"1995","unstructured":"Ad\u00e1mek, J., Koubek, V.: On the greatest fixed point of a set functor. TCS\u00a0150, 57\u201375 (1995)","journal-title":"TCS"},{"key":"4_CR5","series-title":"LNCS","volume-title":"FOSSACS 2012","author":"J. Ad\u00e1mek","year":"2012","unstructured":"Ad\u00e1mek, J., Milius, S., Moss, L.S., Sousa, L.: Well-pointed coalgebras. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, Springer, Heidelberg (2012)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-04081-8_12","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M. Boreale","year":"2009","unstructured":"Boreale, M.: Weighted Bisimulation in Linear Algebraic Form. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 163\u2013177. Springer, Heidelberg (2009)"},{"issue":"6","key":"4_CR7","first-page":"529","volume":"12","author":"J.A. Brzozowski","year":"1962","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata\u00a012(6), 529\u2013561 (1962)","journal-title":"Mathematical Theory of Automata"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-22321-1_10","volume-title":"Developments in Language Theory","author":"J. Brzozowski","year":"2011","unstructured":"Brzozowski, J., Tamm, H.: Theory of \u00c1tomata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 105\u2013116. Springer, Heidelberg (2011)"},{"issue":"2-3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.09.021","volume":"331","author":"G.L. Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E.: Coalgebraic minimization of HD-automata for the pi-calculus using polymorphic types. TCS\u00a0331(2-3), 325\u2013365 (2005)","journal-title":"TCS"},{"key":"4_CR10","unstructured":"Fitting, M.: Bisimulations and boolean vectors. In: Advances in Modal Logic, vol.\u00a04, pp. 1\u201329. World Scientific Publishing (2002)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11548133_13","volume-title":"Algebra and Coalgebra in Computer Science","author":"H.P. Gumm","year":"2005","unstructured":"Gumm, H.P.: From T-Coalgebras to Filter Structures and Transition Systems. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 194\u2013212. Springer, Heidelberg (2005)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10485-007-9116-1","volume":"16","author":"H.P. Gumm","year":"2008","unstructured":"Gumm, H.P.: On minimal coalgebras. Applied Categorical Structures\u00a016, 313\u2013332 (2008)","journal-title":"Applied Categorical Structures"},{"issue":"4:11","key":"4_CR13","first-page":"1","volume":"3","author":"I. Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. LMCS\u00a03(4:11), 1\u201336 (2007)","journal-title":"LMCS"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. TCS\u00a0138(2), 353\u2013389 (1995)","journal-title":"TCS"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C. Hermida","year":"1998","unstructured":"Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Information and Computation\u00a0145, 107\u2013152 (1998)","journal-title":"Information and Computation"},{"key":"4_CR16","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Wesley (2006)"},{"key":"4_CR17","unstructured":"Kurz, A.: Logics for Coalgebras and Applications to Computer Science. PhD thesis, Ludwigs-Maximilians-Universit\u00e4t M\u00fcnchen (2000)"},{"key":"4_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1971","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-58027-1_15","volume-title":"Mathematical Foundations of Programming Semantics","author":"P.S. Mulry","year":"1994","unstructured":"Mulry, P.S.: Lifting Theorems for Kleisli Categories. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol.\u00a0802, pp. 304\u2013319. Springer, Heidelberg (1994)"},{"key":"4_CR20","unstructured":"Panangaden, P.: Duality in probabilistic automata Slides (May 19, 2011), \n                  \n                    http:\/\/www.cs.mcgill.ca\/~prakash\/Talks\/duality_talk.pdf"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. In: Proc. of CTCS 1999. ENTCS, vol.\u00a029, pp. 259\u2013274 (1999)","DOI":"10.1016\/S1571-0661(05)80319-6"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. TCS\u00a0249, 3\u201380 (2000)","journal-title":"TCS"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. LMCS\u00a07(1) (2011)","DOI":"10.2168\/LMCS-7(1:13)2011"},{"issue":"1-3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","volume":"338","author":"J. Worrell","year":"2005","unstructured":"Worrell, J.: On the final sequence of a finitary set functor. TCS\u00a0338(1-3), 184\u2013199 (2005)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:07:30Z","timestamp":1620126450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}