{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:29Z","timestamp":1740114449354,"version":"3.37.3"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"content-version":"vor","delay-in-days":1468,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MI 717\/5-1"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1016\/j.tcs.2015.03.035","type":"journal-article","created":{"date-parts":[[2015,4,5]],"date-time":"2015-04-05T16:44:58Z","timestamp":1428252298000},"page":"81-101","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Coalgebraic constructions of canonical nondeterministic automata"],"prefix":"10.1016","volume":"604","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":"78","reference":[{"key":"10.1016\/j.tcs.2015.03.035_br0010","series-title":"Proc. Foundations of Software Science and Computation Structures","first-page":"58","article-title":"A coalgebraic perspective on minimization and determinization","volume":"vol. 7213","author":"Ad\u00e1mek","year":"2012"},{"key":"10.1016\/j.tcs.2015.03.035_br0020","first-page":"2","article-title":"Well-pointed coalgebras","volume":"3","author":"Ad\u00e1mek","year":"2013","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.tcs.2015.03.035_br0030","series-title":"Proc. FOSSACS 2014","first-page":"366","article-title":"Generalized Eilenberg theorem I: local varieties of languages","volume":"vol. 8412","author":"Ad\u00e1mek","year":"2014"},{"key":"10.1016\/j.tcs.2015.03.035_br0040","series-title":"Proc. Mathematical Foundations of Programming Science","first-page":"3","article-title":"On continuous nondeterminism and state minimality","volume":"vol. 308","author":"Ad\u00e1mek","year":"2014"},{"issue":"6","key":"10.1016\/j.tcs.2015.03.035_br0050","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1017\/S0960129506005706","article-title":"Iterative algebras at work","volume":"16","author":"Ad\u00e1mek","year":"2006","journal-title":"Math. Structures Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2015.03.035_br0060","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","article-title":"Terminal coalgebras in well-founded set theory","volume":"114","author":"Barr","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2015.03.035_br0070","series-title":"Proc. Workshop on Logic, Language, Information and Computation","first-page":"191","article-title":"Minimization via duality","author":"Bezhanishvili","year":"2012"},{"key":"10.1016\/j.tcs.2015.03.035_br0080","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ic.2011.12.002","article-title":"A coalgebraic perspective on linear weighted automata","volume":"211","author":"Bonchi","year":"2012","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.tcs.2015.03.035_br0090","series-title":"Logic and Program Semantics","first-page":"12","article-title":"Brzozowski's algorithm (co)algebraically","author":"Bonchi","year":"2012"},{"key":"10.1016\/j.tcs.2015.03.035_br0100","first-page":"7","article-title":"Sound and complete axiomatizations of coalgebraic language equivalence","volume":"1","author":"Bonsangue","year":"2013","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.tcs.2015.03.035_br0110","series-title":"Proc. 15th International Conference on Developments in Language Theory","first-page":"105","article-title":"Theory of \u00e1tomata","volume":"vol. 6795","author":"Brzozowski","year":"2011"},{"key":"10.1016\/j.tcs.2015.03.035_br0120","series-title":"Mathematical theory of Automata","first-page":"529","article-title":"Canonical regular expressions and minimal state graphs for definite events","volume":"vol. 12","author":"Brzozowski","year":"1962"},{"key":"10.1016\/j.tcs.2015.03.035_br0130","first-page":"1","article-title":"Residual finite state automata","volume":"XX","author":"Denis","year":"2002","journal-title":"Fund. Inform."},{"key":"10.1016\/j.tcs.2015.03.035_br0140","series-title":"Proc. Joint Meeting of the Human Language Technology Conference and the North American Chapter of the Association for Computational Linguistics","first-page":"64","article-title":"Simpler and more general minimisation for weighted finite-state automata","author":"Eisner","year":"2003"},{"key":"10.1016\/j.tcs.2015.03.035_br0150","first-page":"11","article-title":"Generic trace semantics via coinduction","volume":"4","author":"Hasuo","year":"2007","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.tcs.2015.03.035_br0160","series-title":"Proc. Coalgebraic Methods in Computer Science","first-page":"109","article-title":"Trace semantics via determinization","volume":"vol. 7399","author":"Jacobs","year":"2012"},{"key":"10.1016\/j.tcs.2015.03.035_br0170","series-title":"Proc. Relational and Algebraic Methods in Computer Science","first-page":"195","article-title":"Categories of algebraic contexts equivalent to idempotent semirings and domain semirings","volume":"vol. 7560","author":"Jipsen","year":"2012"},{"year":"1982","series-title":"Stone Spaces","author":"Johnstone","key":"10.1016\/j.tcs.2015.03.035_br0180"},{"key":"10.1016\/j.tcs.2015.03.035_br0190","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.tcs.2008.06.005","article-title":"On varieties of meet automata","volume":"407","author":"Kl\u00edma","year":"2008","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2015.03.035_br0200","series-title":"Logic and Automata","first-page":"457","article-title":"The universal automaton","volume":"vol. 2","author":"Lombardy","year":"2008"},{"issue":"4","key":"10.1016\/j.tcs.2015.03.035_br0210","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","article-title":"A logical calculus of the ideas immanent in nervous activity","volume":"5","author":"McCulloch","year":"1943","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/j.tcs.2015.03.035_br0220","series-title":"Proc. 25th Annual Symposium on Logic in Computer Science","first-page":"449","article-title":"A sound and complete calculus for finite stream circuits","author":"Milius","year":"2010"},{"key":"10.1016\/j.tcs.2015.03.035_br0230","series-title":"Proc. Coalgebraic Methods in Computer Science","first-page":"189","article-title":"Canonical nondeterministic automata","volume":"vol. 8446","author":"Myers","year":"2014"},{"key":"10.1016\/j.tcs.2015.03.035_br0240","first-page":"9","article-title":"Generalizing determinization from automata to coalgebras","volume":"1","author":"Silva","year":"2013","journal-title":"Log. Methods Comput. Sci."},{"year":"2010","series-title":"Efficient equivalence and minimization for non deterministic Xor automata","author":"Vuillemin","key":"10.1016\/j.tcs.2015.03.035_br0250"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515002625?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515002625?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T09:49:11Z","timestamp":1573206551000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397515002625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":25,"alternative-id":["S0304397515002625"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2015.03.035","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Coalgebraic constructions of canonical nondeterministic automata","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2015.03.035","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}