{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:12:35Z","timestamp":1725732755468},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44124-4_11","type":"book-chapter","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T11:20:39Z","timestamp":1408447239000},"page":"189-210","source":"Crossref","is-referenced-by-count":1,"title":["Canonical Nondeterministic Automata"],"prefix":"10.1007","author":[{"given":"Robert S. R.","family":"Myers","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Ad\u00e1mek","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,20]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-28729-9_4","volume-title":"Foundations of Software Science and Computational Structures","author":"J Ad\u00e1mek","year":"2012","unstructured":"Ad\u00e1mek, J., Bonchi, F., H\u00fclsbusch, M., K\u00f6nig, B., Milius, S., Silva, A.: A coalgebraic perspective on minimization and determinization. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 58\u201373. Springer, Heidelberg (2012)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-28729-9_6","volume-title":"Foundations of Software Science and Computational Structures","author":"J Ad\u00e1mek","year":"2012","unstructured":"Ad\u00e1mek, J., Milius, S., Moss, L.S., Sousa, L.: Well-pointed coalgebras (extended abstract). In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 89\u2013103. Springer, Heidelberg (2012)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theor. Comput. Sci. 114(2), 299\u2013315 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-32621-9_14","volume-title":"Logic, Language, Information and Computation","author":"N Bezhanishvili","year":"2012","unstructured":"Bezhanishvili, N., Kupke, C., Panangaden, P.: Minimization via duality. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol. 7456, pp. 191\u2013205. Springer, Heidelberg (2012)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ic.2011.12.002","volume":"211","author":"F Bonchi","year":"2012","unstructured":"Bonchi, F., Bonsangue, M.M., Boreale, M., Rutten, J.J.M.M., Silva, A.: A coalgebraic perspective on linear weighted automata. Inform. Comput. 211, 77\u2013105 (2012)","journal-title":"Inform. Comput."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-29485-3_2","volume-title":"Logic and Program Semantics","author":"F Bonchi","year":"2012","unstructured":"Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M., Silva, A.: Brzozowski\u2019s algorithm (co)algebraically. In: Constable, R.L., Silva, A. (eds.) Logic and Program Semantics, Kozen Festschrift. LNCS, vol. 7230, pp. 12\u201323. Springer, Heidelberg (2012)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2422085.2422092","volume":"14","author":"MM Bonsangue","year":"2013","unstructured":"Bonsangue, M.M., Milius, S., Silva, A.: Sound and complete axiomatizations of coalgebraic language equivalence. ACM Trans. Comput. Log. 14(1), 7:1\u20137:52 (2013)","journal-title":"ACM Trans. Comput. Log."},{"key":"11_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 \u00e1tomata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 105\u2013116. Springer, Heidelberg (2011)"},{"key":"11_CR9","series-title":"MRI Symposia Series","first-page":"529","volume-title":"Mathematical Theory of Automata","author":"JA Brzozowski","year":"1962","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529\u2013561. Polytechnic Press\/Polytechnic Institute of Brooklyn, New York (1962)"},{"key":"11_CR10","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fund. Inform. XX, 1\u201330 (2002)"},{"issue":"4:11","key":"11_CR11","first-page":"1","volume":"3","author":"I Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Methods Comput. Sci. 3(4:11), 1\u201336 (2007)","journal-title":"Log. Methods Comput. Sci."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-32784-1_7","volume-title":"Coalgebraic Methods in Computer Science","author":"B Jacobs","year":"2012","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. In: Pattinson, D., Schr\u00f6der, L. (eds.) CMCS 2012. LNCS, vol. 7399, pp. 109\u2013129. Springer, Heidelberg (2012)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-33314-9_13","volume-title":"Relational and Algebraic Methods in Computer Science","author":"P Jipsen","year":"2012","unstructured":"Jipsen, P.: Categories of algebraic contexts equivalent to idempotent semirings and domain semirings. In: Kahl, W., Griffin, T.G. (eds.) RAMICS 2012. LNCS, vol. 7560, pp. 195\u2013206. Springer, Heidelberg (2012)"},{"key":"11_CR14","series-title":"Texts in Logic and Games","first-page":"457","volume-title":"Logic and Automata","author":"S Lombardy","year":"2008","unstructured":"Lombardy, S., Sakarovitch, J.: The universal automaton. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol. 2, pp. 457\u2013504. Amsterdam University Press, Amsterdam (2008)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Milius, S.: A sound and complete calculus for finite stream circuits. In: Proceedings of 25th Annual Symposium on Logic in Computer Science (LICS\u201910), pp. 449\u2013458. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.11"},{"issue":"1:9","key":"11_CR16","first-page":"23","volume":"9","author":"A Silva","year":"2013","unstructured":"Silva, A., Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M.: Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci 9(1:9), 23 (2013)","journal-title":"Log. Methods Comput. Sci"},{"key":"11_CR17","unstructured":"Vuillemin, J., Gama, N.: Efficient equivalence and minimization for non deterministic Xor automata. Research report, LIENS (May 2010). \n http:\/\/hal.inria.fr\/inria-00487031"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44124-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:55:52Z","timestamp":1558961752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44124-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44124-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}