Please use this identifier to cite or link to this item:
Full metadata record
|dc.contributor.author||José Nuno Oliveira||en|
|dc.description.abstract||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. 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. Some attention is paid to the interface between the index-free (categorial) language of matrix algebra and the corresponding index-wise, set-theoretic notation.||en|
|dc.title||WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES||en|
|Appears in Collections:||HASLab - Articles in International Journals|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.