{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:05:29Z","timestamp":1742987129198,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319197968"},{"type":"electronic","value":"9783319197975"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19797-5_11","type":"book-chapter","created":{"date-parts":[[2015,6,10]],"date-time":"2015-06-10T15:56:37Z","timestamp":1433951797000},"page":"224-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Regular Varieties of Automata and Coequations"],"prefix":"10.1007","author":[{"given":"J.","family":"Salamanca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Ballester-Bolinches","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. M.","family":"Bonsangue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Cosme-Ll\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. J. M. M.","family":"Rutten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abel, A., Pientka, B., Thibodeau, D., Setzer, A.: Copatterns: programming infinite structures by observations. In: Giacobazzi, R., Cousot, R. (eds.) Proceedings of the 40th Annual ACM Symposium on Principles of Programming Languages (POPL \u201913), pp. 27\u201338, ACM (2013)","DOI":"10.1145\/2429069.2429075"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-54830-7_24","volume-title":"Foundations of Software Science and Computation Structures","author":"J Ad\u00e1mek","year":"2014","unstructured":"Ad\u00e1mek, J., Milius, S., Myers, R.S.R., Urbat, H.: Generalized Eilenberg theorem I: local varieties of languages. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 366\u2013380. Springer, Heidelberg (2014)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0960129502003894","volume":"13","author":"S Awodey","year":"2003","unstructured":"Awodey, S., Hughes, J.: Modal operators and the formal dual of Birkhoff\u2019s completeness theorem. Math. Struct. Comput. Sci. 13(2), 233\u2013258 (2003)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR4","unstructured":"Ballester-Bolinches, A., Cosme-Ll\u00f3pez, E., Rutten, J.J.M.M.: The dual equivalence of equations and coequations for automata. CWI Technical Report report FM-1403, pp. 1\u201330 (2014)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G Birkhoff","year":"1935","unstructured":"Birkhoff, G.: On the structure of abstract algebras. Proc Camb. Philos. Soc. 31, 433\u2013454 (1935)","journal-title":"Proc Camb. Philos. Soc."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2490818","volume":"15","author":"F Bonchi","year":"2014","unstructured":"Bonchi, F., Bonsangue, M., Hansen, H., Panangaden, P., Rutten, J., Silva, A.: Algebra-coalgebra duality in Brzozowski\u2019s minimization algorithm. ACM Trans. Comput. Logic 15(1), 1\u201327 (2014)","journal-title":"ACM Trans. Comput. Logic"},{"key":"11_CR7","volume-title":"A Course in Universal Algebra, Graduate Texts in Mathematics","author":"SN Burris","year":"1981","unstructured":"Burris, S.N., Sankappanavar, H.P.: A Course in Universal Algebra, Graduate Texts in Mathematics. Springer, New York (1981)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11560647_19","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"R Clouston","year":"2005","unstructured":"Clouston, R., Goldblatt, R.: Covarieties of coalgebras: comonads and coequations. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 288\u2013302. Springer, Heidelberg (2005)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"Automata, Languages and Programming","author":"M Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.\u00c9.: Duality and equational theory of regular languages. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"issue":"4","key":"11_CR10","first-page":"210","volume":"26","author":"E Graczy\u0144ska","year":"1997","unstructured":"Graczy\u0144ska, E.: Birkhoff\u2019s theorems for regular varieties. Bull. Sect. Logic, Univ. \u0141\u00f3d\u017a 26(4), 210\u2013219 (1997)","journal-title":"Bull. Sect. Logic, Univ. \u0141\u00f3d\u017a"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.4064\/fm-61-2-183-189","volume":"61","author":"J P\u0142onka","year":"1967","unstructured":"P\u0142onka, J.: On a method of construction of abstract algebras. Fund. Math. 61, 183\u2013189 (1967)","journal-title":"Fund. Math."},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"JJMM Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR13","first-page":"1","volume":"5","author":"W Taylor","year":"1979","unstructured":"Taylor, W.: Equational logic. Houston J. Math. 5, 1\u201383 (1979)","journal-title":"Houston J. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19797-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:48:31Z","timestamp":1667418511000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19797-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319197968","9783319197975"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19797-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}