{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:56Z","timestamp":1740099176927,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"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_2","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:25:34Z","timestamp":1538760334000},"page":"21-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["C-Dioids and $$\\mu $$-Continuous Chomsky-Algebras"],"prefix":"10.1007","author":[{"given":"Hans","family":"Lei\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Hopkins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BFb0048939","volume-title":"Programming Languages and Their Definition","author":"H Beki\u0107","year":"1984","unstructured":"Beki\u0107, H.: Definable operations in general algebras, and the theory of automata and flowcharts. In: Jones, C.B. (ed.) Programming Languages and Their Definition. LNCS, vol. 177, pp. 30\u201355. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/BFb0048939"},{"key":"2_CR2","unstructured":"de Bakker, J., Scott, D.: A theory of programs. IBM Seminar, Vienna (1969)"},{"key":"2_CR3","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"},{"volume-title":"Idempotency","year":"1998","key":"2_CR4","unstructured":"Gunawardena, J. (ed.): Idempotency. Publications of the Newton Institute, Cambridge University Press, Cambridge (1998)"},{"key":"2_CR5","volume-title":"Introduction to Formal Languages","author":"M Harrison","year":"1978","unstructured":"Harrison, M.: Introduction to Formal Languages. Addison Wesley, Reading (1978)"},{"key":"2_CR6","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). https:\/\/doi.org\/10.1007\/978-3-540-78913-0_13"},{"key":"2_CR7","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). https:\/\/doi.org\/10.1007\/978-3-540-78913-0_14"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-030-02149-8_3","volume-title":"RAMiCS 2018","author":"M Hopkins","year":"2018","unstructured":"Hopkins, M., Lei\u00df, H.: Coequalizers and tensor products for continuous idempotent semirings. In: Desharnais, J., Guttmann, W., Joosten, S. (eds.) RAMiCS 2018. LNCS, vol. 11194, pp. 37\u201352. Springer, Cham (2018)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0025782","volume-title":"Logics of Programs","author":"D Kozen","year":"1982","unstructured":"Kozen, D.: On induction vs. *-continuity. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 167\u2013176. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0025782"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$-calculus. Theor. Comput. Sci. 27(3), 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR11","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":"2_CR12","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":"2_CR13","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). https:\/\/doi.org\/10.1007\/978-1-4612-9839-7"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T11:06:13Z","timestamp":1572001573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_2","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"}}]}}