{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:00Z","timestamp":1759638540230},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642294846"},{"type":"electronic","value":"9783642294853"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29485-3_2","type":"book-chapter","created":{"date-parts":[[2012,4,25]],"date-time":"2012-04-25T13:03:23Z","timestamp":1335359003000},"page":"12-23","source":"Crossref","is-referenced-by-count":13,"title":["Brzozowski\u2019s Algorithm (Co)Algebraically"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Marcello M.","family":"Bonsangue","sequence":"additional","affiliation":[]},{"given":"Jan J. M. M.","family":"Rutten","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Ad\u00e1mek, J., Milius, S., Moss, L.S., Sousa, L.: Well-pointed Coalgebras (Unpublished note)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0022-4049(75)90028-6","volume":"6","author":"M.A. Arbib","year":"1975","unstructured":"Arbib, M.A., Manes, E.G.: Adjoint machines, state-behaviour machines, and duality. Journal of Pure and Applied Algebra\u00a06, 313\u2013344 (1975)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0022-4049(80)90090-0","volume":"19","author":"M.A. Arbib","year":"1980","unstructured":"Arbib, M.A., Manes, E.G.: Machines in a category. Journal of Pure and Applied Algebra\u00a019, 9\u201320 (1980)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-45315-6_5","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Bidoit","year":"2001","unstructured":"Bidoit, M., Hennicker, R., Kurz, A.: On the Duality between Observability and Reachability. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 72\u201387. Springer, Heidelberg (2001)"},{"key":"2_CR5","unstructured":"Bezhanishvili, N., Panangaden, P., Kupke, C.: Minimization via duality (Unpublished note)"},{"issue":"6","key":"2_CR6","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":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-22256-6_9","volume-title":"Implementation and Application of Automata","author":"G. Castiglione","year":"2011","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Nondeterministic Moore Automata and Brzozowski\u2019s Algorithm. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol.\u00a06807, pp. 88\u201399. Springer, Heidelberg (2011)"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Automata and Computability. Springer, Heidelberg (1997)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst.\u00a019, 427\u2013443 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR10","unstructured":"Hundt, C., Panangaden, P., Pineau, J., Precup, D., Dinculescu, M.: The duality of state and observations (Unpublished note)"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"issue":"1","key":"2_CR12","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. Theoretical Computer Science\u00a0249(1), 3\u201380 (2000); Fundamental Study","journal-title":"Theoretical Computer Science"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"issue":"2-3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04(2-3), 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"2_CR15","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing the powerset construction, coalgebraically. In: Proc. of FSTTCS 2010. Leibniz International Proceedings in Informatics (LIPIcs) Series, vol.\u00a08, pp. 272\u2013283 (2010)"},{"key":"2_CR16","unstructured":"Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. Ph.D thesis, Eindhoven University of Technology, The Netherlands (1995)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-44674-5_27","volume-title":"Implementation and Application of Automata","author":"B.W. Watson","year":"2001","unstructured":"Watson, B.W.: Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 311\u2013317. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Logic and Program Semantics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29485-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:34:04Z","timestamp":1558312444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29485-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642294846","9783642294853"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29485-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}