{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:23Z","timestamp":1759639043878},"reference-count":20,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p> The evolution from non-deterministic to weighted automata represents a shift from qualitative to quantitative methods in computer science. The trend calls for a language able to reconcile quantitative reasoning with formal logic and set theory, which have for so many years supported qualitative reasoning. Such a lingua franca should be typed, polymorphic, diagrammatic, calculational and easy to blend with conventional notation. <\/jats:p><jats:p> This paper puts forward typed linear algebra as a candidate notation for such a unifying role. This notation, which emerges from regarding matrices as morphisms of suitable categories, is put at work in describing weighted automata as coalgebras in such categories. <\/jats:p><jats:p> Some attention is paid to the interface between the index-free (categorial) language of matrix algebra and the corresponding index-wise, set-theoretic notation. <\/jats:p>","DOI":"10.1142\/s0129054113400145","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T03:17:54Z","timestamp":1388114274000},"page":"709-728","source":"Crossref","is-referenced-by-count":8,"title":["WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES"],"prefix":"10.1142","volume":"24","author":[{"given":"JOS\u00c9 N.","family":"OLIVEIRA","sequence":"first","affiliation":[{"name":"High Assurance Software Laboratory, INESC TEC and University of Minho, Braga, Portugal"}]}],"member":"219","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"p_2","first-page":"70","volume":"4014","author":"Backhouse R.","year":"2006","journal-title":"LNCS"},{"issue":"8","key":"p_4","first-page":"891","volume":"9","author":"Barbosa L.","year":"2003","journal-title":"JUCS"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(83)90100-7"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00122683"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.12.002"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.11.018"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1007\/s10485-008-9152-5"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1023\/B:APCS.0000018144.87456.10"},{"key":"p_13","first-page":"140","volume":"4608","author":"Cortellessa V.","year":"2007","journal-title":"LNCS"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/PL00000334"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(99)00017-1"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"p_19","first-page":"271","volume":"6120","author":"Macedo H.","year":"2010","journal-title":"LNCS"},{"key":"p_20","first-page":"300","volume":"6921","author":"Macedo H.","year":"2010","journal-title":"LNCS"},{"key":"p_22","unstructured":"Macedo, H., Oliveira, J.: Typing linear algebra: A biproduct-oriented approach. Science of Computer Programming (2012), in press. DOI:10.1016\/j.scico.2012.07.01210.1016\/j.scico.2012.07.012"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-012-0240-9"},{"key":"p_26","first-page":"52","volume":"7381","author":"Oliveira J.","year":"2012","journal-title":"LNCS"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"p_31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.09.007"},{"key":"p_33","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.13.5"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:10:34Z","timestamp":1565107834000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":20,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2013,12,27]]},"published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1142\/S0129054113400145"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400145","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}