{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:19:02Z","timestamp":1742923142332,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480564"},{"type":"electronic","value":"9783662480571"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48057-1_35","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T01:29:54Z","timestamp":1439170194000},"page":"444-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Equations and Coequations for Weighted Automata"],"prefix":"10.1007","author":[{"given":"Julian","family":"Salamanca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Rutten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"35_CR1","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":"3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0022-0000(80)90012-4","volume":"20","author":"MA Arbib","year":"1980","unstructured":"Arbib, M.A., Manes, E.G.: Foundations of system theory: the hankel matrix. J. Comput. Syst. Sci. 20(3), 330\u2013378 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR3","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 FM-1403, pp. 1\u201341 (2014, To appear inInformation and Computation)"},{"key":"35_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":"35_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., Boreale, M., Rutten, J., Silva, A.: A coalgebraic perspective on linear weighted automata. Inf. Comp. 211, 77\u2013105 (2012)","journal-title":"Inf. Comp."},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2490818","volume":"15","author":"F Bonchi","year":"2014","unstructured":"Bonchi, F., Bonsangue, M.M., Hansen, H.H., Panangaden, P., Rutten, J., Silva, A.: Algebra-coalgebra duality in brzozowski\u2019s minimization algorithm. ACM Trans. Comput. Logic 15(1), 3 (2014)","journal-title":"ACM Trans. Comput. Logic"},{"key":"35_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8130-3","volume-title":"A course in universal algebra. Graduate Texts in Mathematic","author":"SN Burri","year":"1981","unstructured":"Burri, S.N., Sankappanava, H.P.: A course in universal algebra. Graduate Texts in Mathematic, vol. 78. Springer, New York (1981)"},{"key":"35_CR8","volume-title":"Automata, languages, and machines","author":"S Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol. B. Academy Press, New York (1976)"},{"key":"35_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)"},{"key":"35_CR10","volume-title":"Algebra. Graduate Texts in Mathematics","author":"TW Hungerford","year":"1974","unstructured":"Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol. 73. Springer, New York (1974)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages, Word, Language, Grammar","author":"W Kuich","year":"1997","unstructured":"Kuich, W.: Semirings and formal power series. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Word, Language, Grammar, vol. 1, pp. 609\u2013677. Springer, Heidelberg (1997)"},{"key":"35_CR12","unstructured":"Petkovi\u0107, T.: Varieties of fuzzy languages. In: Proceedings of International Conference on Algebraic Informatics. Aristotle University of Thessaloniki (2005)"},{"issue":"1","key":"35_CR13","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":"35_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Inf. Control 4, 245\u2013270 (1961)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48057-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:16:47Z","timestamp":1676960207000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48057-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480564","9783662480571"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48057-1_35","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":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}