{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:52Z","timestamp":1740099172208,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030021481"},{"type":"electronic","value":"9783030021498"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02149-8_3","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:25:34Z","timestamp":1538760334000},"page":"37-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Coequalizers and Tensor Products for Continuous Idempotent Semirings"],"prefix":"10.1007","author":[{"given":"Mark","family":"Hopkins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Lei\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"3_CR1","first-page":"461","volume":"18","author":"M Barr","year":"2002","unstructured":"Barr, M.: HSP subcategories of Eilenberg-Moore algebras. Theory Appl. Categ. 18, 461\u2013468 (2002)","journal-title":"Theory Appl. Categ."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"847","DOI":"10.2140\/ant.2009.3.847","volume":"3","author":"GM Bergman","year":"2009","unstructured":"Bergman, G.M.: On coproducts in varieties, quasivarieties and prevarieties. Algebr. Number Theory 3, 847\u2013879 (2009)","journal-title":"Algebr. Number Theory"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N Chomsky","year":"1963","unstructured":"Chomsky, N., Schuetzenberger, M.: The algebraic theory of context free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland, Amsterdam (1963)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.4204\/EPTCS.126.4","volume":"126","author":"Niels Bj\u00f8rn Bugge Grathwohl","year":"2013","unstructured":"Grathwohl, N.B.B., Henglein, F., Kozen, D.: Infinitary axiomatization of the equational theory of context-free languages. In: Baelde, D., Carayol, A. (eds.) Fixed Points in Computer Science (FICS 2013). EPTCS, vol. 126, pp. 44\u201355 (2013)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0022-0000(71)80023-5","volume":"5","author":"J Gruska","year":"1971","unstructured":"Gruska, J.: A characterization of context-free languages. J. Comput. Syst. Sci. 5, 353\u2013364 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR6","volume-title":"Formal Languages and their Relation to Automata","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison Wesley, Reading (1979)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78913-0_13","volume-title":"Relations and Kleene Algebra in Computer Science","author":"M Hopkins","year":"2008","unstructured":"Hopkins, M.: The algebraic approach I: the algebraization of the Chomsky hierarchy. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2008. LNCS, vol. 4988, pp. 155\u2013172. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78913-0_13"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-78913-0_14","volume-title":"Relations and Kleene Algebra in Computer Science","author":"M Hopkins","year":"2008","unstructured":"Hopkins, M.: The algebraic approach II: dioids, quantales and monads. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2008. LNCS, vol. 4988, pp. 173\u2013190. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78913-0_14"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0029594","volume-title":"Mathematical Foundations of Computer Science 1990","author":"D Kozen","year":"1990","unstructured":"Kozen, D.: On Kleene algebras and closed semirings. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 26\u201347. Springer, Heidelberg (1990). \nhttps:\/\/doi.org\/10.1007\/BFb0029594"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"3_CR11","volume-title":"Introduction to Higher Order Categorical Logic","author":"J Lambek","year":"1986","unstructured":"Lambek, J., Scott, P.: Introduction to Higher Order Categorical Logic. Cambridge University Press, New York (1986)"},{"key":"3_CR12","unstructured":"Lang, S.: Algebra. Addison-Wesley, Reading (1965)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0023771","volume-title":"Computer Science Logic","author":"H Lei\u00df","year":"1992","unstructured":"Lei\u00df, H.: Towards Kleene algebra with recursion. In: B\u00f6rger, E., J\u00e4ger, G., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1991. LNCS, vol. 626, pp. 242\u2013256. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/BFb0023771"},{"key":"3_CR14","series-title":"Leibniz International Proceedings in Informatics","first-page":"1","volume-title":"25th EACSL Annual Conference on Computer Science Logic (CSL 2016)","author":"H Lei\u00df","year":"2016","unstructured":"Lei\u00df, H.: The matrix ring of a $$\\mu $$-continuous Chomsky algebra is $$\\mu $$-continuous. In: Regnier, L., Talbot, J.-M. (eds.) 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Leibniz International Proceedings in Informatics, pp. 1\u201316. Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl Publishing (2016)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.apal.2004.10.008","volume":"133","author":"H Lei\u00df","year":"2005","unstructured":"Lei\u00df, H., \u00c9sik, Z.: Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Log. 133, 173\u2013203 (2005)","journal-title":"Ann. Pure Appl. Log."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-030-02149-8_2","volume-title":"RAMiCS 2018","author":"H Lei\u00df","year":"2018","unstructured":"Lei\u00df, H., Hopkins, M.: C-dioids and $$\\mu $$-continuous Chomsky algebras. In: Desharnais, J., et al. (eds.) RAMiCS 2018. LNCS, vol. 11194, pp. 21\u201336. Springer, Cham (2018)"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/2251-7456-7-15","volume":"7","author":"S Liang","year":"2013","unstructured":"Liang, S.: The tensor product of unital quantales. Stud. Math. Sci. 7(1), 15\u201321 (2013)","journal-title":"Stud. Math. Sci."},{"key":"3_CR18","doi-asserted-by":"publisher","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, New York (1971). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-9839-7"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/S0022-0000(71)80020-X","volume":"5","author":"IP McWhirter","year":"1971","unstructured":"McWhirter, I.P.: Substitution expressions. J. Comput. Syst. Sci. 5, 629\u2013637 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0019-9958(71)90419-0","volume":"8","author":"MK Yntema","year":"1971","unstructured":"Yntema, M.K.: Cap expressions for context-free languages. Inf. Control 8, 311\u2013318 (1971)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02149-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:26:29Z","timestamp":1538760389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ramics-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1 full invited talk","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}